A003631 -id:A003631 - cp's OEIS frontend

A071774 Related to Pisano periods: integers k such that the period of Fibonacci numbers mod k equals 2*(k+1).

3, 7, 13, 17, 23, 37, 43, 53, 67, 73, 83, 97, 103, 127, 137, 157, 163, 167, 173, 193, 197, 223, 227, 257, 277, 283, 293, 313, 317, 337, 367, 373, 383, 397, 433, 443, 457, 463, 467, 487, 503, 523, 547, 577, 587, 593, 607, 613, 617, 643, 647, 653, 673, 683, 727

Offset: 1

Benoit Cloitre, Jun 04 2002

Terms are primes with final digit 3 or 7.
Apparently these are the primes given in A003631 without 2 and A216067. - Klaus Purath, Dec 11 2020
If k is a term, then for m=5*k the period of Fibonacci numbers mod m equals 2*(m+5). - Matthew Goers, Jan 13 2021

Michael De Vlieger, Table of n, a(n) for n = 1..3969
Bob Bastasz, Lyndon words of a second-order recurrence, Fibonacci Quarterly (2020) Vol. 58, No. 5, 25-29.

Cf. A001175, A060305, A071776.

Cf. A003631, A216067.

Select[Prime@ Range[129], Function[n, Mod[Last@ NestWhile[{Mod[#2, n], Mod[#1 + #2, n], #3 + 1} & @@ # &, {1, 1, 1}, #[[1 ;; 2]] != {0, 1} &], n] == Mod[2 (n + 1), n] ]] (* Michael De Vlieger, Mar 31 2021, after Leo C. Stein at A001175 *)

for(n=2,5000,t=2*(n+1);good=1;if(fibonacci(t)%n==0, for(s=0,t,if(fibonacci(t+s)%n!=fibonacci(s)%n,good=0;break); if(s>1&&s

forprime(p=3,3000,if(p%5==2||p%5==3,a=1;b=0;c=1;while(a!=0||b!=1,c++;d=a;a=b;a=(a+d)%p;b=d%p);if(c==(2*(p+1)),print1(p",")))) /* V. Raman, Nov 22 2012 */

More terms from Lambert Klasen (Lambert.Klasen(AT)gmx.net), Dec 21 2004

A122870 Primes congruent to 3 or 7 mod 20.

Original entry on oeis.org

3, 7, 23, 43, 47, 67, 83, 103, 107, 127, 163, 167, 223, 227, 263, 283, 307, 347, 367, 383, 443, 463, 467, 487, 503, 523, 547, 563, 587, 607, 643, 647, 683, 727, 743, 787, 823, 827, 863, 883, 887, 907, 947, 967, 983, 1063, 1087, 1103, 1123, 1163, 1187, 1223

Offset: 1

Alexander Adamchuk, Sep 16 2006

nonn

The old name was "Primes p that divide Lucas((p+1)/2) = A000032((p+1)/2)".

Note that F(p+1) = F((p+1)/2)*Lucas((p+1)/2), where F = A000045. Since gcd(F(n),Lucas(n)) = 1 or 2 (because Lucas(n)^2 - 5*F(n)^2 = 4*(-1)^n), this sequence (under the old definition above) lists primes p such that p divides F(p+1) but does not divides F((p+1)/2). By Propositions 1.1 and 1.2 (the k = 3 case) of my link below, this is primes p == 3, 7 (mod 20). - Jianing Song, Jun 20 2025

David A. Cox, "Primes of the Form x^2 + n y^2", Wiley, 1989; see p. 33.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Jianing Song, Lucas sequences and entry point modulo p
Eric Weisstein's World of Mathematics, Lucas Number.
Eric Weisstein's World of Mathematics, Gaussian Prime.

Cf. A000032, A000045, A122869, A216815.

Subseqeunce of A002145, A003631, A049098, A053027. Essentially the same as A106865.

[p: p in PrimesUpTo(1500) | p mod 20 in [3, 7]]; // Vincenzo Librandi, Jan 06 2013

Select[Prime[Range[1000]],IntegerQ[(Fibonacci[(#1+1)/2-1]+Fibonacci[(#1+1)/2+1])/#1]&]
Select[Prime[Range[300]], MemberQ[{3, 7}, Mod[#, 20]]&] (* Vincenzo Librandi, Jan 06 2013 *)

I merged A216816 into this entry at the suggestion of Jianing Song, Jun 20 2025. - N. J. A. Sloane, Jun 22 2025

A123976 Numbers k such that Fibonacci(k-1) is divisible by k.

Original entry on oeis.org

1, 11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 311, 331, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 442, 449, 461, 479, 491, 499, 509, 521, 541, 569, 571, 599, 601

Offset: 1

Tanya Khovanova, Oct 30 2006

nonn

a(n) is a union of {1}, A069106(n) and A045468(n). Composite a(n) are listed in A069106(n) = {442, 1891, 2737, 4181, 6601, 6721, 8149, ...}. Prime a(n) are listed in A045468(n) = {11, 19, 29, 31, 41, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 179, 181, 191, 199, ...} Primes congruent to {1, 4} mod 5. - Alexander Adamchuk, Nov 02 2006

			Fibonacci(10) = 55, is divisible by 11.

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Cf. A069106, A045468, A069104, A069107, A003631, A000045, A023172, A159051.

import Data.List (elemIndices)
a123976 n = a123976_list !! (n-1)
a123976_list = map (+ 1) $ elemIndices 0 $ zipWith mod a000045_list [1..]
-- Reinhard Zumkeller, Oct 13 2011

Select[Range[1000], IntegerQ[Fibonacci[ # - 1]/# ] &]

is(n)=((Mod([1,1;1,0],n))^n)[2,2]==0 \\ Charles R Greathouse IV, Feb 03 2014

A341783 Absolute values of norms of prime elements in Z[(1+sqrt(5))/2], the ring of integers of Q(sqrt(5)).

Original entry on oeis.org

4, 5, 9, 11, 19, 29, 31, 41, 49, 59, 61, 71, 79, 89, 101, 109, 131, 139, 149, 151, 169, 179, 181, 191, 199, 211, 229, 239, 241, 251, 269, 271, 281, 289, 311, 331, 349, 359, 379, 389, 401, 409, 419, 421, 431, 439, 449, 461, 479, 491, 499, 509, 521, 529

Offset: 1

Jianing Song, Feb 19 2021

Also norms of prime ideals in Z[(1+sqrt(5))/2], which is a unique factorization domain. The norm of a nonzero ideal I in a ring R is defined as the size of the quotient ring R/I.
Consists of the primes congruent to 0, 1, 4 modulo 5 and the squares of primes congruent to 2, 3 modulo 5.
For primes p == 1, 4 (mod 5), there are two distinct ideals with norm p in Z[(1+sqrt(5))/2], namely (x + y*(1+sqrt(5))/2) and (x + y*(1-sqrt(5))/2), where (x,y) is a solution to x^2 + x*y - y^2 = p; for p = 5, (sqrt(5)) is the unique ideal with norm p; for p == 2, 3 (mod 5), (p) is the only ideal with norm p^2.

			norm((7 + sqrt(5))/2) = norm((7 - sqrt(5))/2) = 11;
norm((9 + sqrt(5))/2) = norm((9 - sqrt(5))/2) = 19;
norm((11 + sqrt(5))/2) = norm((11 - sqrt(5))/2) = 29;
norm(6 + sqrt(5)) = norm(6 - sqrt(5)) = 31.

Jianing Song, Table of n, a(n) for n = 1..10000

Cf. A080891, A038872, A045468, A003631.
The number of nonassociative elements with absolute value of norm n (also the number of distinct ideals with norm n) is given by A035187.
Norms of prime ideals in O_K, where K is the quadratic field with discriminant D and O_K be the ring of integers of K: A055673 (D=8), this sequence (D=5), A055664 (D=-3), A055025 (D=-4), A090348 (D=-7), A341784 (D=-8), A341785 (D=-11), A341786 (D=-15*), A341787 (D=-19), A091727 (D=-20*), A341788 (D=-43), A341789 (D=-67), A341790 (D=-163). Here a "*" indicates the cases where O_K is not a unique factorization domain.

isA341783(n) = my(disc=5); (isprime(n) && kronecker(disc,n)>=0) || (issquare(n, &n) && isprime(n) && kronecker(disc,n)==-1)

A106282 Primes p such that the polynomial x^3-x^2-x-1 mod p has no zeros; i.e., the polynomial is irreducible over the integers mod p.

Original entry on oeis.org

3, 5, 23, 31, 37, 59, 67, 71, 89, 97, 113, 137, 157, 179, 181, 191, 223, 229, 251, 313, 317, 331, 353, 367, 379, 383, 389, 433, 443, 449, 463, 467, 487, 509, 521, 577, 619, 631, 641, 643, 647, 653, 661, 691, 709, 719, 727, 751, 797, 823, 829, 839, 859, 881

Offset: 1

T. D. Noe, May 02 2005

nonn

This polynomial is the characteristic polynomial of the Fibonacci and Lucas 3-step sequences, A000073 and A001644.

Primes of the form 3x^2+2xy+4y^2 with x and y in Z. - T. D. Noe, May 08 2005

Vincenzo Librandi, Table of n, a(n) for n = 1..300
N. J. A. Sloane et al., Binary Quadratic Forms and OEIS (Index to related sequences, programs, references)
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number

Primes in A028952.
Cf. A106276 (number of distinct zeros of x^3-x^2-x-1 mod prime(n)), A106294, A106302 (period of Lucas and Fibonacci 3-step sequence mod prime(n)), A003631 (primes p such that x^2-x-1 is irreducible mod p).
For a list of sequences giving numbers and/or primes represented by binary quadratic forms, see the "Binary Quadratic Forms and OEIS" link.

t=Table[p=Prime[n]; cnt=0; Do[If[Mod[x^3-x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 200}];Prime[Flatten[Position[t, 0]]]

forprime(p=2,1000,if(#polrootsmod(x^3-x^2-x-1,p)==0,print1(p,", ")));
/* Joerg Arndt, Jul 19 2012 */

A069104 Numbers m such that m divides Fibonacci(m+1).

Original entry on oeis.org

1, 2, 3, 7, 13, 17, 23, 37, 43, 47, 53, 67, 73, 83, 97, 103, 107, 113, 127, 137, 157, 163, 167, 173, 193, 197, 223, 227, 233, 257, 263, 277, 283, 293, 307, 313, 317, 323, 337, 347, 353, 367, 373, 377, 383, 397, 433, 443, 457, 463, 467, 487, 503, 523, 547, 557

Offset: 1

Benoit Cloitre, Apr 06 2002

Equals A003631 union A069107.

Let u(1)=u(2)=1 and (m+2)*u(m+2) = (m+1)*u(m+1) + m*u(m); then sequence gives values of k such that u(k) is an integer.

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Cf. A000045, A023172, A123976, A159051.

import Data.List (elemIndices)
a069104 n = a069104_list !! (n-1)
a069104_list =
   map (+ 1) $ elemIndices 0 $ zipWith mod (drop 2 a000045_list) [1..]
-- Reinhard Zumkeller, Oct 13 2011

Select[Range[6! ],IntegerQ[Fibonacci[ #+1]/# ]&] (* Vladimir Joseph Stephan Orlovsky, Apr 03 2009 *)
Select[Range[600],Mod[Fibonacci[#+1],#]==0&] (* Harvey P. Dale, Feb 24 2025 *)

is(n)=((Mod([1,1;1,0],n))^n)[1,1]==0 \\ Charles R Greathouse IV, Feb 03 2014

A167134 Primes congruent to {2, 3, 5, 7} mod 11.

Original entry on oeis.org

2, 3, 5, 7, 13, 29, 47, 71, 73, 79, 101, 113, 137, 139, 157, 167, 179, 181, 211, 223, 227, 233, 269, 271, 277, 293, 311, 313, 337, 359, 379, 401, 409, 421, 431, 443, 467, 487, 491, 509, 541, 557, 563, 577, 599, 601, 607, 619, 641, 643, 673, 709, 733, 739, 751

Offset: 1

Klaus Brockhaus, Oct 28 2009

Primes p such that p mod 11 is prime.
Primes of the form 11*n+r where n >= 0 and r is in {2, 3, 5, 7}.
2 and primes congruent to {3, 5, 7, 13} mod 22. - Chai Wah Wu, Apr 29 2025

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A003627, A045326, A003631, A045309, A045314, A042987, A078403, A042993, A167134, A167135, A167119: primes p such that p mod k is prime, for k = 3..13 resp.

[ p: p in PrimesUpTo(760) | p mod 11 in {2, 3, 5, 7} ];
[ p: p in PrimesUpTo(760) | exists(t){ n: n in [0..p div 11] | exists(u){ r: r in {2, 3, 5,7} | p eq (11*n+r) } } ];

Select[Prime[Range[600]],MemberQ[{2, 3, 5, 7},Mod[#,11]]&] (* Vincenzo Librandi, Aug 05 2012 *)

A167135 Primes congruent to {2, 3, 5, 7, 11} mod 12.

Original entry on oeis.org

2, 3, 5, 7, 11, 17, 19, 23, 29, 31, 41, 43, 47, 53, 59, 67, 71, 79, 83, 89, 101, 103, 107, 113, 127, 131, 137, 139, 149, 151, 163, 167, 173, 179, 191, 197, 199, 211, 223, 227, 233, 239, 251, 257, 263, 269, 271, 281, 283, 293, 307, 311, 317, 331, 347, 353, 359

Offset: 1

Klaus Brockhaus, Oct 28 2009

Primes p such that p mod 12 is prime.
Primes of the form 12*n+r where n >= 0 and r is in {2, 3, 5, 7, 11}.
Except for the prime 2, these are the primes that are encountered in the set of numbers {x, f(f(x))} where x is of the form 4k+3 with k>=0, and where f(x) is the 3x+1-problem function, and f(f(x)) the second iteration value. Indeed this sequence is the set union of 2 and A002145 (4k+3 primes) and A007528 (6k+5 primes), since f(f(4k+3))=6k+5. Equivalently one does not get any prime from A068228 (the complement of the present sequence). - Michel Marcus and Bill McEachen, May 07 2016

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Subsequences: A002145, A007528. Complement: A068228.

Cf. A003627, A045326, A003631, A045309, A045314, A042987, A078403, A042993, A167134, A167135, A167119: primes p such that p mod k is prime, for k = 3..13 resp.

[ p: p in PrimesUpTo(760) | p mod 12 in {2, 3, 5, 7, 11} ];

[ p: p in PrimesUpTo(760) | exists(t){ n: n in [0..p div 12] | exists(u){ r: r in {2, 3, 5,7, 11} | p eq (12*n+r) } } ];

isA167135  := n -> isprime(n) and not modp(n, 12) != 1:
select(isA167135, [$1..360]); # Peter Luschny, Mar 28 2018

Select[Prime[Range[400]],MemberQ[{2,3, 5, 7, 11},Mod[#,12]]&] (* Vincenzo Librandi, Aug 05 2012 *)
Select[Prime[Range[72]], Mod[#, 12] != 1 &] (* Peter Luschny, Mar 28 2018 *)

A122487 2 together with odd primes p that divide Fibonacci[(p+1)/2].

Original entry on oeis.org

2, 13, 17, 37, 53, 73, 97, 113, 137, 157, 173, 193, 197, 233, 257, 277, 293, 313, 317, 337, 353, 373, 397, 433, 457, 557, 577, 593, 613, 617, 653, 673, 677, 733, 757, 773, 797, 853, 857, 877, 937, 953, 977, 997, 1013, 1033, 1093, 1097, 1117, 1153, 1193, 1213

Offset: 1

Alexander Adamchuk, Sep 16 2006

Primes of the form 2x^2+2xy+13y^2. Discriminant = -100. - T. D. Noe, May 02 2008

Primes of the form a^2 + b^2 such that a^2 == b^2 (mod 5). - Thomas Ordowski, May 18 2015

Giovanni Resta, Table of n, a(n) for n = 1..1000

Cf. A000045, A033205, A045468, A003631, A053028, A139827.

Select[Prime[Range[1000]],IntegerQ[Fibonacci[(#1+1)/2]/#1]&]

is(n)=my(k=n%20); (k==13||k==17||k==2) && isprime(n) \\ Charles R Greathouse IV, May 18 2015

Except for 2, the primes are congruent to {13, 17} (mod 20). - T. D. Noe, May 02 2008

2 together with all primes p == {13, 17} (mod 20). - Thomas Ordowski, May 18 2015

Definition changed by T. D. Noe, May 02 2008

A167119 Primes congruent to 2, 3, 5, 7 or 11 (mod 13).

Original entry on oeis.org

2, 3, 5, 7, 11, 29, 31, 37, 41, 59, 67, 83, 89, 107, 109, 137, 163, 167, 193, 197, 211, 223, 239, 241, 263, 271, 293, 317, 349, 353, 367, 379, 397, 401, 419, 421, 431, 449, 457, 479, 499, 509, 523, 557, 577, 587, 601, 613, 631, 653, 661, 683, 691, 709, 733, 739, 743, 757

Offset: 1

Vladimir Joseph Stephan Orlovsky, Oct 27 2009

Primes which have a remainder mod 13 that is prime.

Union of A141858, A100202, A102732, A140371 and A140373. - R. J. Mathar, Oct 29 2009

			11 mod 13 = 11, 29 mod 13 = 3, 31 mod 13 = 5, hence 11, 29 and 31 are in the sequence.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A003627, A045326, A003631, A045309, A045314, A042987, A078403, A042993, A167134, A167135: primes p such that p mod k is prime, for k = 3..12 resp.

[ p: p in PrimesUpTo(740) | p mod 13 in {2, 3, 5, 7, 11} ]; // Klaus Brockhaus, Oct 28 2009

f[n_]:=PrimeQ[Mod[n,13]]; lst={};Do[p=Prime[n];If[f[p],AppendTo[lst,p]],{n,6,6!}];lst
Select[Prime[Range[4000]],MemberQ[{2, 3, 5, 7, 11},Mod[#,13]]&] (* Vincenzo Librandi, Aug 05 2012 *)

{forprime(p=2, 740, if(isprime(p%13), print1(p, ",")))} \\ Klaus Brockhaus, Oct 28 2009

Edited by Klaus Brockhaus and R. J. Mathar, Oct 28 2009 and Oct 29 2009

cp's OEIS Frontend

A071774 Related to Pisano periods: integers k such that the period of Fibonacci numbers mod k equals 2*(k+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Extensions

A122870 Primes congruent to 3 or 7 mod 20.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

Extensions

A123976 Numbers k such that Fibonacci(k-1) is divisible by k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

A341783 Absolute values of norms of prime elements in Z[(1+sqrt(5))/2], the ring of integers of Q(sqrt(5)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

A106282 Primes p such that the polynomial x^3-x^2-x-1 mod p has no zeros; i.e., the polynomial is irreducible over the integers mod p.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A069104 Numbers m such that m divides Fibonacci(m+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

A167134 Primes congruent to {2, 3, 5, 7} mod 11.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

A167135 Primes congruent to {2, 3, 5, 7, 11} mod 12.

Views