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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086651 a(1)=1, a(2)=1 and for n>2, a(n) is the smallest positive integer such that the third order absolute difference gives the Fibonacci numbers A000045 = {1,1,2,3,5,8,...}. 1
1, 1, 2, 5, 5, 10, 23, 23, 2, 57, 57, 146, 379, 379, 2, 989, 989, 2586, 6767, 6767, 2, 17713, 17713, 46370, 121395, 121395, 2, 317813, 317813, 832042, 2178311, 2178311, 2, 5702889, 5702889, 14930354, 39088171, 39088171, 2, 102334157, 102334157 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

It appears that a(6k+3) is always 2. Is this easy to prove?

CROSSREFS

Cf. A000045.

Sequence in context: A081240 A184443 A132295 * A074495 A081467 A194119

Adjacent sequences:  A086648 A086649 A086650 * A086652 A086653 A086654

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Sep 11 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 17 00:09 EST 2012. Contains 205978 sequences.