19794
domain: N
Appears in sequences
- Number of achiral hexagonal polyominoes with n cells.at n=14A030225
- Numbers k such that 75*2^k+1 is prime.at n=40A032387
- Numbers k such that the k-th triangular number contains only digits {1,5,9}.at n=10A119139
- Numbers k such that k^2 + 1 == 0 (mod 41^2).at n=23A157116
- Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=3A252203
- Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=0A252206
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=6A252210
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 1 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=9A252210
- G.f. satisfies A(x) = (1 + x*A(x))^3 * (1 + x^2*A(x)^3).at n=6A274379
- Triangle read by rows: T(n,k) number of ways of partitioning the (n+4)-element multiset {1,1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 4.at n=80A291119
- Expansion of Product_{k>=1} (1 + x^k)^(2^k-1).at n=11A319919
- Number of permutations p of [n] such that |p(i) - p(i-1)| <= 3 and |p(i) - p(i-2)| <= 4.at n=14A338614
- Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.at n=33A340757