Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086651
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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,...}. +0
2
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; listen)
OFFSET

1,3

COMMENT

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

CROSSREFS

Cf. A000045.

Sequence in context: A034387 A081240 A132295 this_sequence A074495 A081467 A084721

Adjacent sequences: A086648 A086649 A086650 this_sequence A086652 A086653 A086654

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Sep 11 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research