30724
domain: N
Appears in sequences
- Denominators of continued fraction convergents to sqrt(373).at n=6A041707
- Catafusenes (see reference for precise definition).at n=16A045907
- Integers k such that 3*10^k + 71 is a prime number.at n=13A110933
- The length of Sapro's necklace at successive years in Werneck's Black Pearl Necklace problem.at n=23A140261
- G.f. A(x) equals the composition of functions x*(1 + a(n)*x^n); let F_1(x) = x, F_{n+1}(x) = x*(1 + a(n)*F_n(x)^n), then A(x) = limit F_n(x): A(x) = ...o x*(1+a(n)*x^n) o...o x*(1+a(2)*x^2) o x*(1+a(1)*x).at n=9A163133
- Number of (n+2) X (3+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=5A252418
- Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=2A252421
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=30A252423
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=33A252423
- Number of positive subset sums of strict integer partitions of n.at n=40A284640
- a(n) = Sum_{k=0..n} 3^k * binomial(n,k) * binomial(n+2,k).at n=5A388202
- Numbers k such that there is a smaller number m > 1 such that k*m equals the concatenation of digit-wise multiplication, keeping the leading digits of k when m has fewer digits.at n=41A392568