28270

Appears in sequences

• a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 6) so far).at n=30A060733
• a(n) = a(n-1)+4*a(n-2)-4*a(n-4).at n=14A107385
• Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 3, read by rows.at n=31A174045
• Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 3, read by rows.at n=32A174045
• Consider a number n with m decimal digits. The sequence lists the numbers n having the prefix of length m-1 in the middle of the decimal expansion of prime(n).at n=26A242956
• Numbers k such that 7*10^k + 61 is prime.at n=22A281989
• Number of pairs (p,q) of partitions of n such that the set of parts in q is a proper subset of the set of parts in p.at n=21A369910
• a(n) = ((p-1)^n + (p+1)^n) mod p^2, where p is the n-th prime.at n=54A379544