[seqfan]Re:Fwd：n-A0002828（n）的迭代？
L.埃德森·杰弗里
gmail.com上的lejeffery2
2013年8月19日星期一21:02:17 CEST
AK>。。。轨迹会到达每个平方-1（A005563）<之前的k吗达到零？对于任意n，是否足以证明最大值（平方-1<n）在弹道？AK>这意味着只有一个无限序列a_n这样，a（n-1）=a（n）-加起来等于a（n）的最小平方数。这应该是下面第一个三角形中的第一列。AK>那么，在计算从A005563（n+1）跳到A005562（n）所需的迭代次数？根据下面的第二个三角形，你的跳跃序列应该是{1,1,2,2,4,4,5,5，…}，除非我误解或计算错误。不确定你所说的“规律性”到底是什么意思好主意，安蒂。n 0≤n≤48的轨迹序列--- -----------------------------------------0 01 02 03 04 3,05 3,0个6 3,0个7 3,08 6,3,09 8,6,3,010 8,6,3,011 8,6,3,012 9,8,6,3,013 11、8、6、3、014 11,8,6,3,015 11,8,6,3,016 15,11,8,6,3,017 15,11,8,6,3,018 16,15,11,8,6,3,019 16,15,11,8,6,3,020 18,16,15,11,8,6,3,021 18,16,15,11,8,6,3,022 19,16,15,11,8,6,3,023 19,16,15,11,8,6,3,024 21,18,16,15,11,8,6,3,025 24,21,18,16,15,11,8,6,3,026 24,21,18,16,15,11,8,6,3,027 24,21,18,16,15,11,8,6,3,028 24,21,18,16,15,11,8,6,3,029 27,24,21,18,16,15,11,8,6,3,030 27,24,21,18,16,15,11,8,6,3,031 27,24,21,18,16,15,11,8,6,3,032 30,27,24,21,18,16,15,11,8,6,3,033 30,27,24,21,18,16,15,11,8,6,3,034 32,30,27,24,21,18,16,15,11,8,6,3,035 32,30,27,24,21,18,16,15,11,8,6,3,036 35,32,30,27,24,21,18,16,15,11,8,6,3,037 35,32,30,27,24,21,18,16,15,11,8,6,3,038 35,32,30,27,24,21,18,16,15,11,8,6,3,039 35,32,30,27,24,21,18,16,15,11,8,6,3,040 38,35,32,30,27,24,21,18,16,15,11,8,6,3,041 38,35,32,30,27,24,21,18,16,15,11,8,6,3,042 39,35,32,30,27,24,21,18,16,15,11,8,6,3,043 40,38,35,32,30,27,21,18,16,15,11,8,6,3,044 41,38,35,32,30,27,21,18,16,15,11,8,6,3,045 43,40,38,35,32,30,27,24,21,18,16,15,11,8,6,3,046 43,40,38,35,32,30,27,24,21,18,16,15,11,8,6,3,047 43,40,38,35,32,30,27,24,21,18,16,15,11,8,6,3,048 45,43,40,38,35,32,30,27,24,21,18,16,15,11,8,6,3,0n n^2-1 n^2-1，1<=n<=7的轨迹--- ------- -----------------------------------------1 0 02 3 03 8 6,3,04 15 11,8,6,3,05 24 21,18,16,15,11,8,6,3,06 35 32,30,27,24,21,18,16,15,11,8,6,3,07 48 45,43,40,38,35,32,30,27,24,21,18,16,15,11,8,6,3,0埃德·杰弗里
有关SeqFan的更多信息邮件列表