30006

Appears in sequences

• Expansion of Product_{m>=1} (1+q^m)^(-9).at n=12A022604
• Numbers k such that 3*2^k + 7 is prime.at n=33A059746
• Numbers k such that the number of primes between k and 2k (inclusive) is equal to the number of primes between k and reverse(k) (inclusive).at n=31A074814
• If n==0 (mod 3) then a(n)=a(n-1); if n==1 (mod 3) then a(n)=a(n-2)+a(n-3); if n==2 (mod 3) then a(n)=a(n-3)+a(n-4)+a(n-5).at n=37A104204
• Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 9.at n=54A136850
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 6 and 9.at n=20A136894
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 9.at n=25A136932
• Numbers k such that k and k^2 use only the digits 0, 3, 5, 6 and 9.at n=19A136939
• Numbers k such that k and k^2 use only the digits 0, 3, 6, 7 and 9.at n=19A136944
• Numbers k such that k and k^2 use only the digits 0, 3, 6, 8 and 9.at n=30A136945
• Numbers k such that k and k^2 use only the digits 0, 3, 6 and 9.at n=19A136946
• Number of n X 2 0..1 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..1 introduced in row major order.at n=14A240513
• Consider a number n with m decimal digits. The sequence lists the numbers n having the suffix of length m-1 in the middle of the decimal expansion of n^2.at n=39A242964
• Number T(n,k) of set partitions of [n], where k is minimal such that for all j in [n]: j is member of block b implies b = 1 or at least one of j-1, ..., j-k is member of a block >= b-1; triangle T(n,k), n >= 0, 0 <= k <= max(floor(n/2), n-2), read by rows.at n=42A287640