A023173 -id:A023173 - cp's OEIS frontend

A072874 Numbers k such that A000213(k) == 1 (mod k).

1, 2, 4, 8, 16, 24, 28, 32, 36, 47, 53, 56, 64, 72, 80, 94, 103, 106, 128, 163, 192, 199, 206, 256, 257, 269, 311, 326, 336, 384, 397, 398, 401, 419, 421, 456, 499, 512, 514, 536, 538, 587, 599, 617, 622, 683, 700, 757, 768, 773, 794, 802, 838, 842, 863, 883, 907

Offset: 1

Benoit Cloitre, Jul 28 2002

Includes A000079. - Robert Israel, Jul 23 2024

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000213, A023173.

m = 1000; t = LinearRecurrence[{1, 1, 1}, {1, 1, 3}, m]; Position[(t - 1)/Range[m], ?IntegerQ] // Flatten (* _Amiram Eldar, May 05 2022 *)

a(1) = 1 inserted by Amiram Eldar, May 05 2022

A253109 a(n) = n ^ (Fibonacci(n) mod n).

Original entry on oeis.org

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

Offset: 1

Carlos Eduardo Olivieri, Dec 26 2014

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

			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.

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

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

seq(n ^ (combinat:-fibonacci(n) mod n), n=1 .. 50); # Robert Israel, Dec 28 2014

Table[n ^ Mod[Fibonacci[n], n], {n, 29}]

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

cp's OEIS Frontend

A072874 Numbers k such that A000213(k) == 1 (mod k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A253109 a(n) = n ^ (Fibonacci(n) mod n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Magma

Maple

Mathematica

PARI