24967

Properties

Appears in sequences

• a(n) = 1^2 + prime(1)^2 + prime(2)^2 + ... + prime(n)^2.at n=19A024525
• Primes of the form k^2 + 3.at n=26A049423
• Primes p such that p-1 divides 2^p-2.at n=20A069051
• Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].at n=31A078851
• Lesser member p of cousin primes (p, p+4) such that (p+1, p+2, p+3) all have the same number of prime divisors (counted with multiplicity).at n=20A094230
• Position where n (presumably) appears the last time in A107261, or 0 if n keeps appearing.at n=27A107262
• Duplicate of A049423.at n=26A121825
• Primes p such that q = 4p^2 + 1 and r = 4q^2 + 1 are also prime.at n=33A122424
• Primes p such that 2p + 3, 4p + 9, 3p + 2 and 9p + 8 are also primes.at n=15A176619
• Primes p such that p^2 divides 2^(2^(p-1)-1) - 1.at n=28A188465
• Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,4,1,2 for x=0,1,2,3,4.at n=10A196142
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 803", based on the 5-celled von Neumann neighborhood.at n=26A273578
• Numbers k such that A019320(k) is in A217468.at n=37A297412
• Numbers k such that 2^m == 2 (mod m*(m-1)), where m=A019320(k).at n=48A297413
• a(n) = number of primes that end in 1 among the first 10^n primes.at n=4A300397
• a(n) = (4*n^3 - 6*n^2 + 20*n + 3)/3.at n=27A322597
• Array T(n, m) read by ascending antidiagonals: numerators of shifted Fubini numbers F(n, m) where m >= 0.at n=31A338875
• Numbers k such that binomial(k, 2) divides binomial(2^k-2, 2).at n=54A350402
• Primes of the form A321513(k) + 1 for some k > 0.at n=33A352966
• Greatest prime dividing 2^n + n.at n=18A359685