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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049062 Composite n coprime to 5 such that Fibonacci(n) == Legendre(n,5) (mod n). 3
4181, 5474, 5777, 6479, 6721, 10877, 12958, 13201, 15251, 17302, 27071, 34561, 40948, 41998, 44099, 47519, 51841, 54839, 64079, 64681, 65471, 67861, 68251, 72831, 75077, 78089, 88198, 90061, 95038, 96049, 97921 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

If n is a prime, not 5, then Fibonacci(n) == Legendre(n,5) (mod n) (see for example G. H. Hardy and E. M. Wright, Theory of Numbers).

REFERENCES

Yorinaga, Masataka; On a congruencial property of Fibonacci numbers-considerations and remarks. Math. J. Okayama Univ. 19 (1976/77), no. 1, 11-17.

Yorinaga, Masataka; On a congruencial property of Fibonacci numbers-numerical experiments. Math. J. Okayama Univ. 19 (1976/77), no. 1, 5-10.

MATHEMATICA

Select[ Range[ 2, 100000 ], ! PrimeQ[ # ] && Mod[ #, 5 ] != 0 && Mod[ Fibonacci[ # ] - JacobiSymbol[ #, 5 ], # ] == 0 & ]

CROSSREFS

Cf. A090820.

Sequence in context: A104918 A179249 A045734 * A093372 A091982 A072322

Adjacent sequences:  A049059 A049060 A049061 * A049063 A049064 A049065

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Yorinaga gives table up to 707000.

More terms from Eric S Rowland, Apr 29 2004

Definition corrected by Eric S Rowland, Feb 24 2006

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:08 EST 2012. Contains 205860 sequences.