42294

Appears in sequences

• Numbers k such that 3*2^k + 1 is prime.at n=26A002253
• Indices of primes in the sequence defined by A(0) = 23, A(n) = 10*A(n-1) + 63 for n > 0.at n=18A101973
• 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, 0, 0), (-1, 0, 1), (0, -1, 1), (0, 1, -1), (1, 0, 1)}.at n=9A149361
• G.f. is the polynomial (Product_{k=1..20} (1 - x^(3*k)))/(1-x)^20.at n=5A162640
• a(1) = 1; a(2*n) = prime(n)*a(n), a(2*n+1) = prime(n)*a(n) + a(n+1), where prime(n) is the n-th prime.at n=31A176716
• a(n) = Bell(n)*(2 - 0^n).at n=9A186021
• Smallest Product_{i:lambda} prime(i) for any perfect partition lambda of n.at n=31A259939
• Smallest Product_{i:lambda} prime(i) for any complete partition lambda of n.at n=31A259941
• Numbers k such that 3*2^k + 1 is a prime factor of a generalized Fermat number 3^(2^m) + 1 for some m.at n=19A268657
• Indices where A092243 strictly changes sign.at n=23A269737
• Number T(n,k) of set partitions of [n] such that k is the largest element of the last block; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=54A271466
• Number of set partitions of [n] such that 10 is the largest element of the last block.at n=0A271749
• a(n) = Product_{d|n} prime(d).at n=15A275700
• Numbers of the form Bell(i)*Bell(j).at n=29A276281
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=13A291844
• Column 0 of triangle A291844.at n=6A294160
• Write n as a sum of distinct powers of 2, then take the primes of those powers of 2 and multiply them together.at n=31A325094
• Heinz numbers of strict perfect integer partitions.at n=5A325782
• Heinz numbers of uniform perfect integer partitions.at n=21A326037
• Heinz number of the multiset of differences between consecutive divisors of n.at n=31A328023