Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
1,2
Table of n, a(n) for n=1..64.
a(15)=[ 15/1 ]+[ 15/2 ]+[ 15/3 ]+[ 15/5 ]+[ 15/8 ]+[ 15/13 ]+[ 15/21 ]+...=32.
with(combinat): for n from 1 to 200 do printf(`%d, `, sum(floor(n/fibonacci(k)), k=2..15)) od:
Cf. A005086.
Sequence in context: A131628 A079091 A191749 * A246405 A190328 A248106
Adjacent sequences: A038660 A038661 A038662 * A038664 A038665 A038666
nonn,easy
Antreas P. Hatzipolakis (xpolakis(AT)hol.gr)
More terms from Simon Plouffe, who points out that the first differences give A005086
More terms from James A. Sellers, Feb 19 2001
approved