login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038663 [ n/F_2 ] + [ n/F_3 ] + [ n/F_4 ] +..., F_n=Fibonacci numbers. 5
1, 3, 5, 7, 9, 12, 13, 16, 18, 21, 22, 25, 27, 29, 32, 35, 36, 39, 40, 43, 46, 48, 49, 53, 55, 58, 60, 62, 63, 67, 68, 71, 73, 76, 78, 81, 82, 84, 87, 91, 92, 96, 97, 99, 102, 104, 105, 109, 110, 113, 115, 118, 119, 122, 125, 128, 130, 132, 133, 137, 138, 140, 143, 146 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..64.

EXAMPLE

a(15)=[ 15/1 ]+[ 15/2 ]+[ 15/3 ]+[ 15/5 ]+[ 15/8 ]+[ 15/13 ]+[ 15/21 ]+...=32.

MAPLE

with(combinat): for n from 1 to 200 do printf(`%d, `, sum(floor(n/fibonacci(k)), k=2..15)) od:

CROSSREFS

Cf. A005086.

Sequence in context: A131628 A079091 A191749 * A190328 A033036 A198082

Adjacent sequences:  A038660 A038661 A038662 * A038664 A038665 A038666

KEYWORD

nonn,easy

AUTHOR

Antreas P. Hatzipolakis (xpolakis(AT)hol.gr)

EXTENSIONS

More terms from Simon Plouffe, who points out that the first differences give A005086

More terms from James A. Sellers, Feb 19 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 17 03:18 EDT 2014. Contains 240628 sequences.