35908
domain: N
Appears in sequences
- Numbers k such that 10^k+9^(k-1) is prime.at n=22A096186
- Triangle, read by rows, of coefficients of q^(nk+k) in the q-analog of the odd double factorials: T(n,k) = [q^(nk+k)] Product_{j=1..n+1} (1-q^(2j-1))/(1-q) for n>0, with T(0,0)=1.at n=46A128592
- Column 1 of triangle A128592; a(n) = coefficient of q^(n+2) in the q-analog of the odd double factorials (2n+3)!! for n>=0.at n=8A128593
- Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=6A298504
- Number of nX7 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=3A298507
- T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=48A298508
- T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=51A298508
- Number of partitions of the (n+3)-multiset {0,...,0,1,2,3} with n 0's into distinct multisets.at n=24A346823