33936
domain: N
Appears in sequences
- Expansion of (1-x^6) / (1-x)^6.at n=19A008488
- Expansion of tan(log(1+x)*exp(x)).at n=8A009651
- Increments used in Sedgewick-Incerpi upper bound for shell sort.at n=11A036569
- Numbers k such that cototient(k) is a square and sets a new record for squares.at n=39A063753
- Lengths of the loop of the sequences "Sum of last n digits" beginning with (n-1) zeros followed by digit 1.at n=20A112546
- a(n) = binomial(n+6,5) - binomial(n,5).at n=18A120478
- G.f.: A(x) = A_1 where A_1 = 1/[1 - x*(A_2)^3], A_2 = 1/[1 - x^2*(A_3)^3], A_3 = 1/[1 - x^3*(A_4)^3], ... A_n = 1/[1 - x^n*(A_{n+1})^3] for n>=1.at n=14A132334
- The case S(6,-4,-1) of the family of self-convolutive recurrences studied by Martin and Kearney.at n=4A172455
- Inverse of coefficient array for orthogonal polynomials p(n,x)=(x-(2n-1))*p(n-1,x)-(2n-2)^2*p(n-2,x).at n=41A182824
- Number of zero trace primitive elements in Galois field GF(11^n).at n=5A192215
- a(n) = Sum_{1 <= i, j, k, l, m <= n} gcd(i,j,k,l,m).at n=7A344524
- Triangle read by rows: T(n,k) = number of heapable permutations of length n with exactly k consecutive pairs.at n=47A389993