29009

Properties

Appears in sequences

• Primes that remain prime through 3 iterations of function f(x) = 8x + 7.at n=14A023294
• a(n) = number of permutations of {1,...,n} which are twice but not 3-times reformable.at n=8A055459
• Primes of the form 1+2*n+3*n^2.at n=14A122430
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=9A149001
• Least Ramanujan prime having a gap of 2n to the previous Ramanujan prime.at n=37A182875
• Principal diagonal of the convolution array A213781.at n=42A213782
• Primes having only {0, 2, 9} as digits.at n=14A261268
• a(n) = (2*n^6 - 6*n^5 + 5*n^4 - n^2 + 12)/12.at n=8A263689
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 942", based on the 5-celled von Neumann neighborhood.at n=7A273796
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=2A303467
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=30A303469
• Number of 3Xn 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=5A303470
• Number of prime parts, counted without multiplicity, in all compositions of n.at n=15A336632
• Primes having only {0, 2, 4, 9} as digits.at n=31A386048
• Primes having only {0, 2, 5, 9} as digits.at n=29A386050
• Primes having only {0, 2, 6, 9} as digits.at n=33A386052
• Primes having only {0, 2, 8, 9} as digits.at n=31A386055
• Prime numbersat n=3154