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!)
A214795 a(n) is the smallest k>=2 such that n divides Fibonacci(k-1)+21. 3
2, 2, 5, 5, 10, 5, 9, 5, 17, 12, 2, 5, 6, 9, 13, 17, 8, 17, 11, 53, 9, 2, 4, 5, 30, 6, 45, 17, 7, 33, 23, 41, 13, 8, 33, 17, 47, 11, 21, 53, 29, 9, 53, 23, 93, 33, 25, 17, 65, 30, 29, 23, 42, 45, 10, 17, 29, 21, 51, 53 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The n-th entry a(n) means that a(n) is the index of the first term in A000045+21 which n divides.

LINKS

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

CROSSREFS

Cf. A214789, A213790, A214791, A214792

Sequence in context: A062405 A071181 A213675 * A214253 A171967 A079964

Adjacent sequences:  A214792 A214793 A214794 * A214796 A214797 A214798

KEYWORD

nonn

AUTHOR

Art DuPre, Aug 03 2012

EXTENSIONS

Definition corrected. - R. J. Mathar, Aug 09 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 6 08:53 EST 2016. Contains 278775 sequences.