45181

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 2x + 9.at n=22A023306
• 5-digit terms in the continued fraction for Pi.at n=24A048960
• Honaker primes of the form p = 2*k-1 with sum-of-digits(p) = sum-of-digits(k).at n=27A176111
• Primes of the form 2*n^2 + 78*n + 37.at n=21A217501
• Number of (n+2) X (3+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010001.at n=6A260202
• Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010001.at n=2A260206
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010001.at n=38A260207
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010001.at n=42A260207
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 33", based on the 5-celled von Neumann neighborhood.at n=41A269812
• a(n) = |Sum_{k=0..n} (-1)^k*(3k)!!|.at n=4A290046
• Primes in A290046.at n=1A290047
• a(2) = a(3) = 1; for n >3, a(n) = largest prime factor of n-th Tribonacci number.at n=41A366584
• Prime numbersat n=4690