22697

Properties

Appears in sequences

• Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=39A030504
• a(0) = 1; for n>0, a(n) = smallest prime of the form k*a(n-1) + 1.at n=8A061092
• Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.at n=20A083809
• Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.at n=25A083809
• a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).at n=5A083810
• Primes p such that 2^j+p^j are primes for j=0,1,2,4.at n=10A094487
• Larger prime in pair prime(k) +/- k for some k.at n=29A107637
• Triangle read by rows: n-th row begins with n and contains n terms with the same prime signature such that the (r+1)-th term == 1 (mod r-th term).at n=26A113031
• Collatz (or 3x+1) trajectory starting at 10087.at n=4A161022
• Primes p such that 2*p^3 -+ 3 are also prime.at n=21A174363
• Primes of the form 3n^2 - 10.at n=13A201782
• Primes p such that floor(log(p)) + p^2 is prime.at n=17A225626
• The first member of a twin prime pair whose sum equals the sums of k consecutive smaller pairs of twin primes, k=3.at n=24A226692
• First primes of arithmetic progressions of 7 primes each with the common difference 210.at n=20A227282
• Primes p such that p+2, p+24 and p+246 are also primes.at n=23A235871
• Primes p with prime(p)^3 + 2*p^3 and p^3 + 2*prime(p)^3 both prime.at n=10A236574
• Primes p such that prime(p)^2 - 2 = prime(q) for some prime q.at n=21A261354
• Number of odd singletons in all partitions of n (n>=0).at n=36A265257
• Primes 8k + 1 at the end of the maximal gaps in A269424.at n=9A269426
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 35", based on the 5-celled von Neumann neighborhood.at n=32A269816