|
Search: id:A105753
|
|
|
| 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). |
|
+0
5
|
|
| 1, 3, 4, 8, 6, 22, 9, 16, 53, 11, 133, 13, 279, 15, 573, 69, 18, 1233, 20, 2486, 23, 44, 4995, 25, 10059, 27, 20145, 29, 40319, 31, 80669, 33, 161371, 35, 322777, 37, 645591, 39, 1291221, 41, 2582483, 43, 5165009, 5039, 46, 10335103, 48
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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]
|
|
REFERENCES
|
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.
|
|
FORMULA
|
a(a(n)) = sum_{k=1}^n a(k).
|
|
EXAMPLE
|
S reads (from the beginning) : - at position 1 there is the sum of all previously written terms [indeed, nil + 1=1]
- at position 3 there is the sum of all previously written terms [indeed, 1+ 3=4]
- at position 4 there is the sum of all previously written terms [indeed, 1+3+4=8]
- at position 8 there is the sum of all previously written terms [indeed, 1+3+4+8=16]
- at position 6 there is the sum of all previously written terms [indeed, 1+3+4+8+6=22]
- 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]
etc.
|
|
CROSSREFS
|
Cf. A121053, A121173, A121174, A121175.
Sequence in context: A079787 A081307 A081543 this_sequence A019972 A064406 A049826
Adjacent sequences: A105750 A105751 A105752 this_sequence A105754 A105755 A105756
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Aug 13 2006
|
|
EXTENSIONS
|
More terms from Max Alekseyev, Aug 14, 2006
|
|
|
Search completed in 0.002 seconds
|
