|
%I #24 Jun 06 2016 05:43:26
%S 1,2,3,4,6,7,8,9,11,12,14,15,16,18,19,21,22,23,24,26,27,28,29,30,31,
%T 32,33,34,35,36,38,39,41,42,43,44,46,47,48,49,51,54,55,56,57,59,60,61,
%U 62,63,64,66,67,69,70,71,72,74,75,76,77,78,79,81,83,84,86,87,88,89,91,92,93,94
%N Smallest number that is not the sum of squares of two distinct earlier terms.
%H Ivan Neretin, <a href="/A008320/b008320.txt">Table of n, a(n) for n = 1..10000</a>
%H Mihaly Bencze [Beneze], <a href="http://www.gallup.unm.edu/~smarandache/SN/ScArt5/RecSeq.pdf">Smarandache Recurrence Type Sequences</a>, Unknown source, pp. 99-102. Originally appeared in Bull. Pure Appl. Sciences.
%H F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/Sequences-book.pdf">Sequences of Numbers Involved in Unsolved Problems</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SmarandacheSequences.html">Smarandache Sequences.</a>
%t FixedPoint[Complement[Range@100, Flatten@Table[#[[i]]^2 + #[[j]]^2, {i, Length[#]}, {j, i - 1}]] &, {}] (* _Ivan Neretin_, Jun 05 2016 *)
%Y A026468 is the version without "distinct".
%K nonn
%O 1,2
%A R. Muller
%E More terms from _David W. Wilson_
|
