|
|
A001463
|
|
Partial sums of A001462; also a(n) is the last occurrence of n in A001462.
(Formerly M2438 N0965)
|
|
6
|
|
|
1, 3, 5, 8, 11, 15, 19, 23, 28, 33, 38, 44, 50, 56, 62, 69, 76, 83, 90, 98, 106, 114, 122, 131, 140, 149, 158, 167, 177, 187, 197, 207, 217, 228, 239, 250, 261, 272, 284, 296, 308, 320, 332, 344, 357, 370, 383, 396, 409, 422, 436, 450, 464, 478, 492, 506, 521, 536, 551, 566, 581, 596
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Vardi gives several identities satisfied by A001463 and this sequence.
|
|
REFERENCES
|
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
a(n) is asymptotic to tau^(1-tau)*n^tau where tau is the golden ratio, tau=(1+sqrt(5))/2. More precisely, a(n)= tau^(1-tau)*n^tau + c*n^(1/tau)+0(n^(1/tau)) where c is a constant around 0.6. Is there any known value for c? - Benoit Cloitre, Oct 29 2002
|
|
MATHEMATICA
|
|
|
PROG
|
(Haskell)
a001463 n = a001463_list !! (n-1)
a001463_list = scanl1 (+) a001462_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|