28697

Properties

Appears in sequences

• Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) with a(0) = a(1) = a(2) = a(3) = a(4) = 1.at n=18A000322
• Primes equal to the sum of the first k primes for some k.at n=11A013918
• Primes that remain prime through 3 iterations of function f(x) = 5x + 4.at n=38A023284
• Primes that remain prime through 4 iterations of function f(x) = 5x + 4.at n=10A023314
• a(n+1) is the smallest prime > a(n) such that a(n+1) == a(n-1) (mod a(n)).at n=8A072999
• Balanced primes of order seven.at n=26A096699
• Primes with digit sum = 32.at n=24A106768
• Records in A111267.at n=22A111268
• a(1) = a(2) = 1. a(n) = a(n-1) + (largest noncomposite {1 or prime} among the first n-2 terms of the sequence).at n=30A120761
• Smaller member p of a pair (p,p+6) of consecutive primes in different centuries.at n=20A160370
• a(1) = 1, a(2) = 2, for n >= 3, a(n) = smallest prime > a(n-1) such that a(n) mod a(n-1) = a(n-2).at n=9A175093
• Number of (n+2) X 8 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order.at n=19A204752
• Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3<=x^3+y^3.at n=36A211807
• Primes in the pentanacci numbers sequence A000322.at n=3A248921
• Longest word T from a string S using no breakpoint-reuse.at n=32A280429
• a(0) = 0, a(1) = 1, and b = a(n-2) + a(n-1). a(n) = b if b is a prime; otherwise a(n) = a(n-1) and a(n-1) = b.at n=36A346957
• Prime numbersat n=3126