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

 

Logo

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".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205451 The index j<k such that n divides s(k)-s(j) for some j, where s(j)=Fibonacci(2j), and k is the least index for which such a j exists. 3
1, 1, 2, 1, 2, 2, 1, 3, 2, 1, 1, 2, 3, 5, 2, 3, 4, 2, 1, 1, 4, 2, 5, 2, 12, 2, 1, 3, 1, 4, 1, 3, 2, 4, 1, 6, 9, 1, 2, 6, 4, 4, 10, 1, 4, 5, 3, 6, 2, 11, 2, 2, 13, 1, 5, 3, 2, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

For a guide to related sequences, see A204892.

LINKS

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

MATHEMATICA

(See the program at A205450.)

CROSSREFS

Cf. A205450, A204892.

Sequence in context: A095686 A105258 A219607 * A227899 A208244 A272171

Adjacent sequences:  A205448 A205449 A205450 * A205452 A205453 A205454

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 27 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 11:34 EST 2016. Contains 279001 sequences.