%I A105753
%S A105753 1,3,4,8,6,22,9,16,53,11,133,13,279,15,573,69,18,1233,20,2486,23,44,
%T A105753 4995,25,10059,27,20145,29,40319,31,80669,33,161371,35,322777,37,
%U A105753 645591,39,1291221,41,2582483,43,5165009,5039,46,10335103,48
%N A105753 Sequence S with property that at position a(n) in S you will find the 
               sum of all terms from a(1) to a(n).
%C A105753 The Fibonacci 9-step numbers referenced in the Noe-Post paper are in 
               A104144. [From T. D. Noe (noe(AT)sspectra.com), Oct 27 2008]
%D A105753 Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas 
               n-step Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 
               05.4.4.
%F A105753 a(a(n)) = sum_{k=1}^n a(k).
%e A105753 S reads (from the beginning) : - at position 1 there is the sum of all 
               previously written terms [indeed, nil + 1=1]
%e A105753 - at position 3 there is the sum of all previously written terms [indeed, 
               1+ 3=4]
%e A105753 - at position 4 there is the sum of all previously written terms [indeed, 
               1+3+4=8]
%e A105753 - at position 8 there is the sum of all previously written terms [indeed, 
               1+3+4+8=16]
%e A105753 - at position 6 there is the sum of all previously written terms [indeed, 
               1+3+4+8+6=22]
%e A105753 - at position 22 there is the sum of all previously written terms [indeed, 
               1+3+4+8+6+22=44 and 44 is the 22nd term of S]
%e A105753 etc.
%Y A105753 Cf. A121053, A121173, A121174, A121175.
%Y A105753 Sequence in context: A079787 A081307 A081543 this_sequence A019972 A064406 
               A049826
%Y A105753 Adjacent sequences: A105750 A105751 A105752 this_sequence A105754 A105755 
               A105756
%K A105753 nonn
%O A105753 1,2
%A A105753 Eric Angelini (eric.angelini(AT)kntv.be), Aug 13 2006
%E A105753 More terms from Max Alekseyev, Aug 14, 2006