login
a(1) = 1, a(2) = 2, a(n) = smallest number not the sum of cubes of >= 1 distinct earlier terms.
0

%I #19 Feb 16 2025 08:32:36

%S 1,2,3,4,5,6,7,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,29,

%T 30,31,32,33,34,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,

%U 55,56,57,58,59,60,61,62,63,66,67,68,69,70,71,74,75,76,77

%N a(1) = 1, a(2) = 2, a(n) = smallest number not the sum of cubes of >= 1 distinct earlier terms.

%D Mihaly Bencze [Beneze], Smarandache recurrence type sequences, Bulletin of pure and applied sciences, Vol. 16E, No. 2, 1997, pp. 231-236.

%D H. Ibstedt, Smarandache Continued Fractions, Smarandache Notions Journal, Vol. 10, No. 1-2-3, 1999, 39-49.

%D F. Smarandache, Properties of numbers, ASU Special Collections, 1973.

%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="https://mathworld.wolfram.com/SmarandacheSequences.html">Smarandache Sequences</a>

%Y Essentially the same as A001476. See also A031980.

%K nonn

%O 1,2

%A J. Castillo (arp(AT)cia-g.com) [Broken email address?]

%E More terms from _Sean A. Irvine_, May 04 2020