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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132634 Fib(n) mod n^2. 1
0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 0, 64, 181, 160, 219, 152, 316, 210, 365, 362, 287, 91, 288, 25, 389, 317, 291, 378, 440, 869, 261, 574, 339, 765, 432, 443, 533, 1285, 1355, 1641, 1504, 85, 1741, 20, 551, 1832, 576, 1457, 1525, 389, 803, 2066, 332, 1820, 245 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

a(n)=0 for n=1 and n=12 only (conjecture).

LINKS

Hieronymus Fischer, Table of n, a(n) for n = 1..1000

EXAMPLE

a(13)=64, since Fib(13)=233==64(mod 13^2).

MATHEMATICA

Table[Mod[Fibonacci[n], n^2], {n, 200}] (*From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), 28 Nov 2010*)

CROSSREFS

Cf. A000045, A023173.

Sequence in context: A191869 A077373 A202278 * A096275 A093089 A093091

Adjacent sequences:  A132631 A132632 A132633 * A132635 A132636 A132637

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Aug 24 2007

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 17:11 EST 2012. Contains 205938 sequences.