cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A077254 a(n) = prime(n)^n mod n.

Original entry on oeis.org

0, 1, 2, 1, 1, 1, 3, 1, 8, 1, 9, 1, 2, 1, 8, 1, 8, 1, 10, 1, 13, 15, 14, 1, 7, 9, 1, 9, 22, 19, 3, 1, 26, 9, 4, 1, 9, 7, 5, 1, 15, 1, 19, 9, 17, 41, 23, 1, 31, 1, 11, 1, 29, 1, 23, 9, 8, 13, 41, 1, 39, 41, 55, 1, 53, 31, 63, 13, 8, 1, 69, 1, 2, 9, 49, 5, 16, 25, 6, 1, 80, 39, 16, 1, 29, 83
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 31 2002

Keywords

Comments

a(A077255(n)) = 1.

Examples

			a(13) = prime(13)^13 mod 13 = 41^13 mod 13 = 925103102315013629321 mod 13 = 2.
		

Crossrefs

a(n) = A062457(n) mod n, A077256, A000040, A000027.

Programs

  • Maple
    a:= n-> ithprime(n) &^ n mod n:
    seq(a(n), n=1..100);  # Alois P. Heinz, Dec 07 2012
  • Mathematica
    Table[PowerMod[Prime[n], n, n], {n, 100}] (* Zak Seidov, Dec 07 2012 *)

A077256 Primes p such that p^k == 1 modulo k, where p=prime(k).

Original entry on oeis.org

3, 7, 11, 13, 19, 29, 37, 43, 53, 61, 71, 89, 103, 131, 151, 173, 181, 223, 229, 239, 251, 281, 311, 349, 359, 409, 433, 503, 541, 571, 593, 601, 619, 659, 661, 683, 691, 701, 719, 769, 827, 857, 911, 941, 953, 997, 1069, 1087, 1091, 1129, 1163, 1223, 1291
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 31 2002

Keywords

Crossrefs

Programs

  • Maple
    g:= proc(t) local p; p:= ithprime(t); if p&^ t mod t = 1 then p else NULL fi end proc:
    map(g, [$1..1000]); # Robert Israel, Oct 31 2016
  • Mathematica
    With[{no=250}, Transpose[Select[Partition[Riffle[Prime[Range[no]], Range[no]],2], PowerMod[First[#],Last[#],Last[#]]==1&]][[1]]]  (* Harvey P. Dale, Jan 05 2011 *)
    Prime[Select[Range[250], PowerMod[Prime[#],#,#]==1&]]

Formula

A077254(A049084(a(n))) = 1.
a(n) = A000040(A077255(n)).
Showing 1-2 of 2 results.