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

A308787 Primes p such that A001175(p) = (p-1)/2.

Original entry on oeis.org

29, 89, 101, 181, 229, 349, 401, 509, 761, 941, 1021, 1061, 1109, 1229, 1249, 1361, 1409, 1549, 1621, 1669, 1709, 1741, 1789, 1861, 2029, 2069, 2089, 2441, 2621, 2801, 2861, 3089, 3169, 3301, 3389, 3461, 3581, 3821, 3881, 3989, 4001, 4049, 4201, 4229, 4549, 4729
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/2, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 2.
Note that the Pisano period of {T(n)} modulo p must be even, so we have p == 1 (mod 4) for primes p in this sequence.
The number of terms below 10^N:
N | Number | Decomposing primes*
3 | 10 | 78
4 | 89 | 609
5 | 630 | 4777
6 | 5207 | 39210
7 | 44296 | 332136
8 | 382966 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), this sequence (s=2), A308788 (s=3), A308789 (s=4), A308790 (s=5), A308791 (s=6), A308792 (s=7), A308793 (s=8), A308794 (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[ Fibonacci[k+1], n] == 1, Return[k]]];
    Reap[For[p = 2, p <= 4729, p = NextPrime[p], If[pn[p] == (p-1)/2, Print[p]; Sow[p]]]][[2, 1]] (* Jean-François Alcover, Jul 01 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 4800, if(Pisano_for_decomposing_prime(p)==(p-1)/2, print1(p, ", ")))

A308789 Primes p such that A001175(p) = (p-1)/4.

Original entry on oeis.org

769, 809, 1049, 1289, 1721, 2729, 3049, 3929, 4289, 4649, 5009, 5441, 5689, 6361, 6961, 7321, 7841, 8209, 8329, 8369, 8681, 9689, 9769, 11161, 11489, 11969, 12049, 12281, 12601, 12721, 13649, 13721, 14969, 15241, 15569, 16649, 17489, 18329, 19961, 21169, 21881
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/4, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 4.
Note that the Pisano period of {T(n)} modulo p must be even, so we have p == 1 (mod 8) for primes p in this sequence.
Number of terms below 10^N:
N | Number | Decomposing primes*
3 | 2 | 78
4 | 23 | 609
5 | 165 | 4777
6 | 1290 | 39210
7 | 10958 | 332136
8 | 95746 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), A308787 (s=2), A308788 (s=3), this sequence (s=4), A308790 (s=5), A308791 (s=6), A308792 (s=7), A308793 (s=8), A308794 (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[ Fibonacci[k + 1], n] == 1, Return[k]]];
    Reap[For[p=2, p <= 21881, p = NextPrime[p], If[pn[p] == (p-1)/4, Print[p]; Sow[p]]]][[2, 1]] (* Jean-François Alcover, Jul 01 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 22000, if(Pisano_for_decomposing_prime(p)==(p-1)/4, print1(p, ", ")))

A308792 Primes p such that A001175(p) = (p-1)/7.

Original entry on oeis.org

2269, 2731, 2969, 3739, 4831, 6091, 6329, 11159, 11789, 13049, 13679, 14281, 14449, 14771, 16871, 19559, 20399, 24179, 26111, 29191, 31039, 33181, 33811, 34511, 34679, 35911, 40111, 41651, 42701, 43961, 49211, 54881, 55259, 55721, 56099, 58129, 60859, 62819, 66809
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/7, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 7.
Number of terms below 10^N:
N | Number | Decomposing primes*
3 | 0 | 78
4 | 7 | 609
5 | 55 | 4777
6 | 507 | 39210
7 | 4144 | 332136
8 | 36319 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), A308787 (s=2), A308788 (s=3), A308789 (s=4), A308790 (s=5), A308791 (s=6), this sequence (s=7), A308793 (s=8), A308794 (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[ Fibonacci[k + 1], n] == 1, Return[k]]];
    Reap[For[p = 2, p < 50000, p = NextPrime[p], If[Mod[p, 7] == 1, If[pn[p] == (p - 1)/7, Print[p]; Sow[p]]]]][[2, 1]] (* Jean-François Alcover, Jul 05 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 67000, if(Pisano_for_decomposing_prime(p)==(p-1)/7, print1(p, ", ")))

A308793 Primes p such that A001175(p) = (p-1)/8.

Original entry on oeis.org

1009, 3329, 8081, 12401, 15889, 19681, 25601, 25841, 26641, 32321, 33329, 33521, 34369, 36929, 41681, 42929, 47809, 53569, 55249, 64849, 70289, 74209, 76081, 85361, 86209, 87649, 88129, 88801, 90001, 93089, 93329, 97649, 98689, 99089, 100049, 101489, 107441, 117841
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/8, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 8.
Note that the Pisano period of {T(n)} modulo p must be even, so we have p == 1 (mod 16) for primes p in this sequence.
Number of terms below 10^N:
N | Number | Decomposing primes*
3 | 0 | 78
4 | 3 | 609
5 | 34 | 4777
6 | 315 | 39210
7 | 2751 | 332136
8 | 23878 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), A308787 (s=2), A308788 (s=3), A308789 (s=4), A308790 (s=5), A308791 (s=6), A308792 (s=7), this sequence (s=8), A308794 (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[ Fibonacci[k + 1], n] == 1, Return[k]]];
    Reap[For[p = 2, p < 50000, p = NextPrime[p], If[Mod[p, 8] == 1, If[pn[p] == (p - 1)/8, Print[p]; Sow[p]]]]][[2, 1]] (* Jean-François Alcover, Jul 05 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 118000, if(Pisano_for_decomposing_prime(p)==(p-1)/8, print1(p, ", ")))

A308790 Primes p such that A001175(p) = (p-1)/5.

Original entry on oeis.org

211, 281, 421, 691, 881, 991, 1031, 1151, 1511, 1871, 1951, 2591, 3251, 3851, 4391, 4651, 4691, 4751, 4871, 5381, 5531, 5591, 5801, 6011, 6101, 6211, 6271, 6491, 7211, 7451, 8011, 8171, 8831, 8861, 9011, 9091, 9241, 9371, 9431, 9931, 10061, 10391, 10531, 10691
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/5, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 5.
Number of terms below 10^N:
N | Number | Decomposing primes*
3 | 6 | 78
4 | 40 | 609
5 | 280 | 4777
6 | 2289 | 39210
7 | 18903 | 332136
8 | 163395 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), A308787 (s=2), A308788 (s=3), A308789 (s=4), this sequence (s=5), A308791 (s=6), A308792 (s=7), A308793 (s=8), A308794 (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[Fibonacci[k + 1], n] == 1, Return[k]]];
    Reap[For[p = 2, p < 11000, p = NextPrime[p], If[Mod[p, 5] == 1, If[pn[p] == (p - 1)/5, Print[p]; Sow[p]]]]][[2, 1]] (* Jean-François Alcover, Jul 05 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 11000, if(Pisano_for_decomposing_prime(p)==(p-1)/5, print1(p, ", ")))

A308791 Primes p such that A001175(p) = (p-1)/6.

Original entry on oeis.org

541, 709, 2389, 3121, 3529, 4561, 4861, 5869, 7069, 8821, 9001, 10789, 12421, 12781, 13309, 14341, 14869, 16981, 18289, 19249, 19309, 19429, 19501, 20389, 20809, 20929, 21649, 22741, 23629, 24181, 25189, 26821, 27109, 27409, 28669, 30181, 30469, 30781, 30949, 31189
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/6, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 6.
Note that the Pisano period of {T(n)} modulo p must be even, so we have p == 1 (mod 12) for primes p in this sequence.
Number of terms below 10^N:
N | Number | Decomposing primes*
3 | 2 | 78
4 | 11 | 609
5 | 112 | 4777
6 | 898 | 39210
7 | 7777 | 332136
8 | 68115 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), A308787 (s=2), A308788 (s=3), A308789 (s=4), A308790 (s=5), this sequence (s=6), A308792 (s=7), A308793 (s=8), A308794 (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[ Fibonacci[k + 1], n] == 1, Return[k]]];
    Reap[For[p = 2, p < 32000, p = NextPrime[p], If[Mod[p, 6] == 1, If[pn[p] == (p - 1)/6, Print[p]; Sow[p]]]]][[2, 1]] (* Jean-François Alcover, Jul 05 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 32000, if(Pisano_for_decomposing_prime(p)==(p-1)/6, print1(p, ", ")))

A308794 Primes p such that A001175(p) = (p-1)/9.

Original entry on oeis.org

199, 919, 6679, 7489, 12979, 16921, 17011, 17659, 20089, 20431, 23059, 23599, 24391, 24859, 25309, 28081, 29629, 33301, 36901, 39079, 39439, 41761, 42589, 43399, 43669, 45361, 46261, 48619, 51481, 53479, 54091, 62011, 62191, 67411, 69499, 72019, 72091, 77419, 78301
Offset: 1

Views

Author

Jianing Song, Jun 25 2019

Keywords

Comments

Primes p such that ord((1+sqrt(5))/2,p) = (p-1)/9, where ord(z,p) is the smallest integer k > 0 such that (z^k-1)/p is an algebraic integer.
Let {T(n)} be a sequence defined by T(0) = 0, T(1) = 1, T(n) = k*T(n-1) + T(n-2), K be the quadratic field Q[sqrt(k^2+4)], O_K be the ring of integer of K, u = (k+sqrt(k^2+4))/2. For a prime p not dividing k^2 + 4, the Pisano period of {T(n)} modulo p (that is, the smallest m > 0 such that T(n+m) == T(n) (mod p) for all n) is ord(u,p); the entry point of {T(n)} modulo p (that is, the smallest m > 0 such that T(m) == 0 (mod p)) is ord(-u^2,p).
For an odd prime p:
(a) if p decomposes in K, then (O_K/pO_K)* (the multiplicative group of O_K modulo p) is congruent to C_(p-1) X C_(p-1), so the Pisano period of {T(n)} modulo p is equal to (p-1)/s, s = 1, 2, 3, 4, ...;
(b) if p is inert in K, then u^(p+1) == -1 (mod p), so the Pisano period of {T(n)} modulo p is equal to 2*(p+1)/r, r = 1, 3, 5, 7, ...
Here k = 1, and this sequence gives primes such that (a) holds and s = 9.
Number of terms below 10^N:
N | Number | Decomposing primes*
3 | 2 | 78
4 | 4 | 609
5 | 49 | 4777
6 | 405 | 39210
7 | 3489 | 332136
8 | 30132 | 2880484
* Here "Decomposing primes" means primes such that Legendre(5,p) = 1, i.e., p == 1, 4 (mod 5).

Crossrefs

Similar sequences that give primes such that (a) holds: A003147/{5} (s=1), A308787 (s=2), A308788 (s=3), A308789 (s=4), A308790 (s=5), A308791 (s=6), A308792 (s=7), A308793 (s=8), this sequence (s=9).

Programs

  • Mathematica
    pn[n_] := For[k = 1, True, k++, If[Mod[Fibonacci[k], n] == 0 && Mod[ Fibonacci[k + 1], n] == 1, Return[k]]];
    Reap[For[p = 2, p < 50000, p = NextPrime[p], If[Mod[p, 9] == 1, If[pn[p] == (p - 1)/9, Print[p]; Sow[p]]]]][[2, 1]] (* Jean-François Alcover, Jul 05 2019 *)
  • PARI
    Pisano_for_decomposing_prime(p) = my(k=1, M=[k, 1; 1, 0], Id=[1, 0; 0, 1]); if(isprime(p)&&kronecker(k^2+4,p)==1, my(v=divisors(p-1)); for(d=1, #v, if(Mod(M,p)^v[d]==Id, return(v[d]))))
    forprime(p=2, 80000, if(Pisano_for_decomposing_prime(p)==(p-1)/9, print1(p, ", ")))

A366951 a(n) = 2*(p_n - 1)/A060305(n) iff p_n == +/- 1 (mod 5), 2*(p_n + 1)/A060305(n) iff p_n == +/- 2 (mod 5), 0 iff p_n = 5.

Original entry on oeis.org

2, 1, 0, 1, 2, 1, 1, 2, 1, 4, 2, 1, 2, 1, 3, 1, 2, 2, 1, 2, 1, 2, 1, 4, 1, 4, 1, 3, 2, 3, 1, 2, 1, 6, 2, 6, 1, 1, 1, 1, 2, 4, 2, 1, 1, 18, 10, 1, 1, 4, 9, 2, 2, 2, 1, 3, 2, 2, 1, 10, 1, 1, 7, 2, 1, 1, 6, 1, 3, 4, 3, 2, 1, 1, 2, 1, 2, 1, 4, 2, 2, 10, 2, 1, 2, 1
Offset: 1

Views

Author

A.H.M. Smeets, Oct 29 2023

Keywords

Crossrefs

Formula

a(n) == 0 (mod 2) for prime(n) == +/- 1 (mod 5) and n > 2.
a(n) == 1 (mod 2) for Prime(n) == +/- 2 (mod 5) and n > 2.
a(n) = 1 iff prime(n) in A071774.
a(n) = 2 iff prime(n) in ({2} union A003147)/{5}.
a(n) = 3 iff prime(n) in A308784.
a(n) = 4 iff prime(n) in A308787.
a(n) = 6 iff prime(n) in A308788.
a(n) = 7 iff prime(n) in A308785.
a(n) = 8 iff prime(n) in A308789.
a(n) = 9 iff prime(n) in A308786.
a(n) = 10 iff prime(n) in A308790.
a(n) = 12 iff prime(n) in A308791.
a(n) = 14 iff prime(n) in A308792.
a(n) = 16 iff prime(n) in A308793.
a(n) = 18 iff prime(n) in A308794.
a(n) = A296240(n) iff prime(n) == +/- 2 (mod 5) and n > 3.
a(n) = 2*A296240(n) iff prime(n) == +/- 1 (mod 5) and n > 3.
a(n) in {2^k: k > 1} iff prime(n) in {A047650}.
a(n) == 3 (mod 6) iff prime(n) in {A124096}.
a(n) == 6 (mod 12) iff prime(n) in {A046652}.
a(n) == 0 (mod 14) iff prime(n) in {A125252}.
Showing 1-8 of 8 results.