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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087347 Numbers n such that n divides sum(k=1,n,F(n*k)) where F(k) denotes the k-th Fibonacci number. 0
1, 2, 5, 8, 12, 15, 20, 24, 25, 32, 36, 44, 48, 50, 56, 60, 63, 72, 80, 84, 95, 96, 104, 108, 110, 120, 125, 128, 135, 140, 144, 152, 155, 168, 175, 180, 185, 192, 200, 204, 207, 209, 216, 224, 228, 240, 252, 264, 276, 279, 288, 300, 320, 323, 324, 336, 360, 368 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

Conjecture: a(n) is asymptotic to c*n*log(n) with c around 1.3.

MATHEMATICA

Select[Range[380], Divisible[Sum[Fibonacci[# k], {k, #}], #]&] (* From Harvey P. Dale, Aug 16 2011 *)

CROSSREFS

Sequence in context: A190000 A080753 A156745 * A062468 A061717 A003314

Adjacent sequences:  A087344 A087345 A087346 * A087348 A087349 A087350

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 20 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 22 2003

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

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

Last modified February 16 06:39 EST 2012. Contains 205861 sequences.