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-9 of 9 results.

A138672 Prime(n)^3 mod prime(n-1).

Original entry on oeis.org

1, 2, 3, 1, 8, 12, 8, 7, 9, 8, 30, 27, 8, 21, 28, 4, 8, 33, 64, 8, 70, 64, 50, 67, 64, 8, 64, 8, 64, 32, 64, 85, 8, 27, 8, 65, 59, 64, 49, 43, 8, 95, 8, 64, 8, 136, 40, 64, 8
Offset: 0

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^3 = 27 = 1 mod 2
a(2)=2 because 5^3 = 125 = 2 mod 3

Links

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^3, Prime[n - 1]], {n, 2, 50}]
PowerMod[#[[2]], 3, #[[1]]] & /@ Partition[Prime[Range[50]], 2, 1] (* Harvey P. Dale, Apr 24 2017 *)

A138673 Prime(n)^4 mod prime(n-1).

Original entry on oeis.org

1, 1, 1, 4, 5, 9, 16, 9, 8, 16, 25, 34, 16, 41, 27, 24, 16, 15, 55, 16, 55, 19, 51, 2, 62, 16, 50, 16, 38, 109, 2, 117, 16, 131, 16, 88, 40, 93, 127, 85, 16, 45, 16, 63, 16, 40, 58, 33, 16
Offset: 0

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^4 = 81 = 1 mod 2
a(2)=2 because 5^4 = 625 = 1 mod 3

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^4, Prime[n - 1]], {n, 2, 50}]

A138674 Prime(n)^5 mod prime(n-1).

Original entry on oeis.org

1, 2, 2, 2, 10, 10, 15, 17, 2, 3, 26, 25, 32, 35, 21, 38, 32, 29, 19, 32, 38, 76, 57, 16, 54, 32, 97, 32, 43, 57, 8, 47, 32, 59, 32, 75, 83, 46, 94, 164, 32, 88, 32, 59, 32, 82, 63, 132, 32
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^5 = 243 = 1 mod 2
a(2)=2 because 5^5 = 3125 = 2 mod 3

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^5, Prime[n - 1]], {n, 2, 50}]

A138675 Prime(n)^6 mod prime(n-1).

Original entry on oeis.org

1, 1, 4, 1, 9, 1, 13, 11, 12, 6, 1, 26, 23, 11, 32, 16, 5, 52, 9, 64, 9, 67, 10, 39, 22, 64, 79, 64, 63, 7, 32, 20, 64, 34, 64, 148, 27, 21, 63, 119, 64, 156, 64, 43, 64, 188, 123, 82, 64
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^6 = 729 = 1 mod 2
a(2)=2 because 5^6 = 15625 = 1 mod 3

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^6, Prime[n - 1]], {n, 2, 50}]

A138676 a(n) = prime(n)^7 mod prime(n-1).

Original entry on oeis.org

1, 2, 3, 4, 7, 4, 9, 6, 3, 12, 6, 30, 5, 1, 4, 43, 10, 7, 36, 57, 54, 31, 60, 45, 88, 27, 7, 21, 34, 98, 1, 120, 128, 62, 128, 133, 5, 84, 44, 22, 128, 112, 128, 172, 128, 67, 210, 105, 128
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

a(n) = 128 if prime(n-1) and prime(n) are twin primes and prime(n-1)>128. - Robert Israel, Feb 12 2020

Examples

			a(1)=1 because 3^7 = 1 mod 2
a(2)=2 because 5^7 = 2 mod 3

Links

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138677, A138678, A138679, A138680, A138681.

Programs

  • Magma
    [NthPrime(n)^7 mod NthPrime(n-1): n in [2..50]]; // Bruno Berselli, May 23 2011
  • Maple
    seq(ithprime(n)&^7 mod ithprime(n-1),n=2..100); # Robert Israel, Feb 12 2020
  • Mathematica
    Table[Mod[Prime[n]^7, Prime[n - 1]], {n, 2, 50}]
(* The following program is more efficient because it only generates each prime once, but it is less easy to understand: *)
PowerMod[Last[#],7,First[#]]&/@Partition[Prime[Range[60]],2,1] (* Harvey P. Dale, Sep 02 2016 *)
  • PARI
    a(n) = my(p=prime(n)); lift(Mod(p, precprime(p-1))); \\ Michel Marcus, Mar 17 2023

A138677 Prime(n)^8 mod prime(n-1).

Original entry on oeis.org

1, 1, 1, 2, 3, 3, 1, 5, 18, 24, 5, 9, 10, 4, 24, 46, 20, 42, 10, 43, 32, 45, 28, 4, 61, 54, 28, 42, 27, 16, 4, 65, 119, 64, 107, 43, 30, 10, 97, 132, 77, 34, 65, 109, 59, 8, 199, 197, 29, 42, 152, 17, 183, 175, 121, 98, 256, 229, 164, 256, 252, 210, 145, 256
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^8 = 1 mod 2
a(2)=2 because 5^8 = 1 mod 3

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^8, Prime[n - 1]], {n, 2, 50}]
PowerMod[#[[2]],8,#[[1]]]&/@Partition[Prime[Range[70]],2,1] (* Harvey P. Dale, Nov 05 2014 *)

Extensions

More terms from Harvey P. Dale, Nov 05 2014

A138678 Prime(n)^9 mod prime(n-1).

Original entry on oeis.org

1, 2, 2, 1, 6, 12, 2, 1, 16, 19, 30, 36, 20, 16, 3, 11, 40, 8, 40, 15, 46, 22, 2, 32, 50, 7, 9, 84, 108, 111, 16, 128, 101, 84, 65, 107, 23, 40, 81, 100, 154, 159, 130, 50, 118, 96, 67, 119, 58
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^9 = 1 mod 2
a(2)=2 because 5^9 = 2 mod 3

Links

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^9, Prime[n - 1]], {n, 2, 50}]
PowerMod[Last[#],9,First[#]]&/@Partition[Prime[Range[50]],2,1] (* Harvey P. Dale, Aug 16 2013 *)

A138679 Prime(n)^10 mod prime(n-1).

Original entry on oeis.org

1, 1, 4, 4, 1, 9, 4, 4, 4, 9, 25, 33, 40, 21, 18, 13, 21, 48, 26, 30, 57, 9, 12, 78, 6, 14, 36, 61, 105, 85, 64, 113, 65, 6, 130, 38, 138, 160, 152, 81, 129, 142, 69, 7, 39, 157, 171, 30, 116
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^10 = 1 mod 2
a(2)=2 because 5^10 = 1 mod 3

Links

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^10, Prime[n - 1]], {n, 2, 50}]
PowerMod[Last[#],10,First[#]]&/@Partition[Prime[Range[50]],2,1] (* Harvey P. Dale, Apr 17 2014 *)

A138680 Prime(n)^11 mod prime(n-1).

Original entry on oeis.org

1, 2, 3, 2, 2, 10, 8, 16, 1, 18, 26, 21, 39, 41, 14, 25, 42, 44, 37, 60, 50, 36, 72, 1, 24, 28, 41, 15, 93, 60, 2, 23, 130, 60, 111, 77, 43, 151, 77, 140, 79, 153, 138, 28, 78, 93, 153, 120, 5
Offset: 2

Views

Author

Artur Jasinski, Mar 26 2008

Keywords

Comments

Related sequences type prime(n)^k mod prime(n-1) (k=1,2,3,4)
prime(n) mod prime(n-1) is given in A001223
prime(n)^2 mod prime(n-1) is given in A038702
prime(n)^3 mod prime(n-1) is given in A138672
prime(n)^4 mod prime(n-1) is given in A138673
prime(n)^5 mod prime(n-1) is given in A138674
prime(n)^6 mod prime(n-1) is given in A138675
prime(n)^7 mod prime(n-1) is given in A138676
prime(n)^8 mod prime(n-1) is given in A138677
prime(n)^9 mod prime(n-1) is given in A138678
prime(n)^10 mod prime(n-1) is given in A138679
prime(n)^11 mod prime(n-1) is given in A138680
prime(n)^12 mod prime(n-1) is given in A138681

Examples

			a(1)=1 because 3^11 = 1 mod 2
a(2)=2 because 5^11 = 2 mod 3

Links

Crossrefs

Cf. A001223, A038702, A138672, A138673, A138674, A138675, A138676, A138677, A138678, A138679, A138680, A138681.

Programs

  • Mathematica
    Table[Mod[Prime[n]^11, Prime[n - 1]], {n, 2, 50}]
PowerMod[Last[#],11,First[#]]&/@Partition[Prime[Range[100]],2,1] (* Harvey P. Dale, Apr 04 2013 *)
Showing 1-9 of 9 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.