41054

Appears in sequences

• Numbers k such that 15*2^k - 1 is prime.at n=34A002237
• a(n) = dot_product(1,2,...,n)*(7,8,...,n,1,2,3,4,5,6).at n=45A026049
• Number of 4n-step self-avoiding closed paths on first quadrant grid, passing through origin, symmetric about line y = x.at n=9A038393
• Fibonacci with priority for primes: a(0)=0, a(1)=1, for n >= 2, a(n) = a(n-1) + a(k), where 0 < k <= n-2 is maximal index such that a(n-1) + a(k) is prime. If there is no such k, then a(n) = a(n-1) + a(n-2).at n=32A216231
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 129", based on the 5-celled von Neumann neighborhood.at n=42A270219
• Square array, read by rows. For n,d >= 0, a(n,d) is the number of congruences of the d-twisted partition monoid of degree n.at n=50A340914