67072
domain: N
Appears in sequences
- Generalized Fibonacci numbers A_{n,4}.at n=40A006209
- Number of different products (including the empty product) of any subset of {1, 2, 3, ..., n}.at n=22A060957
- Difference between larger and smaller terms of n-th amicable pair.at n=32A066539
- Numbers of the form p^9*q where p and q are distinct primes.at n=31A179692
- Number of (n+2)X(n+2) binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=2A202427
- Number of (n+2) X 5 binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=2A202430
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 000 and 001 in rows, columns and nw-to-se diagonals.at n=12A202435
- E.g.f.: Sum_{n>=0} (n^2)^n * cosh(n^2*x) * x^n/n!.at n=4A218297
- Number of (n+1) X (1+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=6A235886
- Number of (n+1) X (7+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2 X 2 subblock.at n=0A235892
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock.at n=21A235893
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the minimum plus the upper median equal to the lower median plus the maximum in every 2X2 subblock.at n=27A235893
- Number of distinct values of |product(A) - product(B)| where A and B are a partition of {1,2,...,n}.at n=23A263292
- Difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933.at n=33A275469
- Totients t such that the number of divisors of t equals the number of solutions of phi(x) = t.at n=32A305058
- E.g.f. S(x) = Integral C(x) * C(S(x)) dx, such that C(x)^2 - S(x)^2 = 1, where S(x) = Sum_{n>=0} a(n)*x^(2*n+1)/(2*n+1)!, with coefficients a(n) starting at n = 0.at n=4A322895
- E.g.f. A(x) = C(x) + S(x) = exp( Integral C(S(x)) dx ) such that C(x)^2 - S(x)^2 = 1, where A(x) = Sum_{n>=0} a(n)*x^n/n!, with coefficients a(n) starting at n = 0.at n=9A322897