30471

Appears in sequences

• Numbers n such that 123*2^n-1 is prime.at n=32A050587
• At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.at n=40A064412
• Expansion of 1 / ((1+x)*(1-2*x)*(1-3*x)*(1-4*x)*(1-5*x)).at n=5A099111
• Structured triakis octahedral numbers (vertex structure 4).at n=20A100171
• Totally multiplicative sequence with a(p) = a(p-1) + 10 for prime p.at n=32A166707
• a(n) = 2*Farey(m; I) - 1 where m = Fibonacci (n + 1) and I = [1/n, 1].at n=11A176502
• Number of (n+1) X (3+1) 0..2 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=7A235879
• The number of P-positions in the game of Nim with up to five piles, allowing for piles of zero, such that the total number of objects in all piles doesn't exceed 2n.at n=17A238147
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 326", based on the 5-celled von Neumann neighborhood.at n=17A281109
• Numbers k such that (2*10^k + 529)/9 is prime.at n=24A281734