login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309373 a(n) is the smallest divisor of F(n+1) not already in the sequence (where F denotes the Fibonacci numbers A000045). 1
1, 2, 3, 5, 4, 13, 7, 17, 11, 89, 6, 233, 29, 10, 21, 1597, 8, 37, 15, 26, 199, 28657, 9, 25, 521, 34, 39, 514229, 20, 557, 47, 178, 3571, 65, 12, 73, 113, 466, 33, 2789, 52, 433494437, 43, 61, 139, 2971215073, 14, 97, 55, 3194, 699, 953, 19, 445, 49, 74, 59 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This sequence is the Fibonacci variant of A309200.
This sequence is a permutation of the natural numbers as for any m > 0, there are infinitely many multiples of m in A000045.
LINKS
EXAMPLE
The first terms, alongside the divisors of F(n+1), are:
n a(n) div(F(n+1))
-- ---- ----------------------------------------
1 1 (1)
2 2 (1, 2)
3 3 (1, 3)
4 5 (1, 5)
5 4 (1, 2, 4, 8)
6 13 (1, 13)
7 7 (1, 3, 7, 21)
8 17 (1, 2, 17, 34)
9 11 (1, 5, 11, 55)
10 89 (1, 89)
11 6 (1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144)
12 233 (1, 233)
PROG
(PARI) See Links section.
CROSSREFS
Sequence in context: A193798 A101409 A271862 * A131401 A061446 A280690
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jul 26 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 08:36 EST 2023. Contains 367663 sequences. (Running on oeis4.)