login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

a(n) = 1 for n in A023172. a(n) = n for n in A023173. - Robert Israel, Dec 28 2014

LINKS

Table of n, a(n) for n=1..26.

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

(PARI) a(n)=n^(fibonacci(n)%n) \\ Charles R Greathouse IV, Feb 02 2015

(MAGMA) [n^(Fibonacci(n) mod n): n in [1..30]]; // Vincenzo Librandi, Feb 03 2015

CROSSREFS

Cf. A000045, A002708, A023172, A023173, A168041.

Sequence in context: A085928 A130169 A218672 * A167913 A076944 A074181

Adjacent sequences:  A253106 A253107 A253108 * A253110 A253111 A253112

KEYWORD

nonn,easy

AUTHOR

Carlos Eduardo Olivieri, Dec 26 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 19:16 EDT 2020. Contains 336428 sequences. (Running on oeis4.)