Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131401
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131401 Least number dividing Fibonacci(n) but not dividing Fibonacci(m) for m < n, or 0 if there is no such number. +0
2
1, 0, 2, 3, 5, 4, 13, 7, 17, 11, 89, 6, 233, 29, 10, 47, 1597, 19, 37, 15, 26, 199, 28657, 14, 25, 521, 53, 39, 514229, 20, 557, 2207, 178, 3571, 65, 27, 73, 9349, 466, 35, 2789, 52, 433494437, 43, 85, 139, 2971215073, 64, 97, 101, 3194, 699, 953, 212, 445, 49, 74, 59 (list; graph; listen)
OFFSET

1,3

COMMENT

First occurrence of n in A001177 or 0 if impossible.

Conjecture: only a(2)=0. I have not found values of a(n)<2*106 less than 100 for n = 43, 47, 74, 82, 83 & 94.

When Fibonacci(n) is a prime number, then a(n)=Fibonacci(n). Note that a(n)=0 for n=2 because Fibonacci(1)=Fibonacci(2)=1. For n>2, an upper bound for a(n) is Fibonnaci(n). The difficulty in computing this sequence for large n is the factorization of Fibonacci(n), which is required to find the divisors of Fibonacci(n). [From T. D. Noe (noe(AT)sspectra.com), Jan 12 2009]

REFERENCES

Alfred S. Posamentier & Ingmar Lehmann, The (Fabulous) Fibonacci Numbers, Afterword by Herbert A. Hauptman, 2. 'The Minor Modulus m(n)', Prometheus Books, NY, 2007, page 329-342.

LINKS

T. D. Noe, Table of n, a(n) for n=1..300

MATHEMATICA

f[n_] := Block[{k = 1}, While[Mod[Fibonacci@k, n] != 0 && k < 101, k++ ]; k]; t = Table[0, {100}]; Do[ a = f@n; If[a < 101 && t[[a]] == 0, t[[a]] = n; Print[{a, n}]], {n, 106}]

nn=100; fib=Fibonacci[Range[nn]]; Join[{1, 0}, Table[dvrs=Rest[Divisors[fib[[n]]]]; k=1; While[d=dvrs[[k]]; pos=Position[fib, _?(Mod[ #, d]==0&), 1, 1]; pos!={{n}}, k++ ]; d, {n, 3, nn}]] [From T. D. Noe (noe(AT)sspectra.com), Jan 12 2009]

CROSSREFS

A060442 [From T. D. Noe (noe(AT)sspectra.com), Jan 12 2009]

Sequence in context: A138153 A023395 A101409 this_sequence A061446 A107476 A094140

Adjacent sequences: A131398 A131399 A131400 this_sequence A131402 A131403 A131404

KEYWORD

nonn

AUTHOR

Herbert A. Hauptman (hauptman(AT)hwi.buffalo.edu) & Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 07 2007

EXTENSIONS

Extension T. D. Noe (noe(AT)sspectra.com), Jan 12 2009

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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research