|
|
A253109
|
|
a(n) = n ^ (Fibonacci(n) mod n).
|
|
0
|
|
|
1, 2, 9, 64, 1, 36, 117649, 32768, 4782969, 100000, 11, 1, 23298085122481, 793714773254144, 576650390625, 17592186044416, 48661191875666868481, 3570467226624, 19, 3200000, 4084101, 22, 907846434775996175406740561329, 1, 1, 236773830007967588876795164938469376
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(3) = 9, since 3^(Fibonacci(3) mod 3) = 3^(2 mod 3) = 3^2 = 9.
a(7) = 117649, since 7^(Fibonacci(7) mod 7) = 7^(13 mod 7) = 7^6 = 117649.
|
|
MAPLE
|
seq(n ^ (combinat:-fibonacci(n) mod n), n=1 .. 50); # Robert Israel, Dec 28 2014
|
|
MATHEMATICA
|
Table[n ^ Mod[Fibonacci[n], n], {n, 29}]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|