72030

Appears in sequences

• 12-gonal (or dodecagonal) pyramidal numbers: a(n) = n*(n+1)*(10*n-7)/6.at n=35A007587
• Triangle of coefficients in expansion of (6+7x)^n.at n=19A013627
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*6^j.at n=16A038272
• Periodic part of continued fraction for sqrt(n), encoded by raising successive primes to the terms. If sqrt(n)=c0+[c1,c2,c3...] then a(n)=2^c1*3^c2*5^c3*...at n=6A059903
• Numbers k > 1 such that, in base 7, k and k^2 contain the same digits in the same proportion.at n=10A061661
• Number of endofunctions of [n] with a cycle a->b->c->a and for all x in [n], some iterate f^k(x)=a.at n=4A065513
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.at n=23A071210
• Triangle, read by rows, of coefficients for the third iteration of the hyperbinomial transform.at n=40A089463
• Triangle R, read by rows, where column k of R equals column 0 of P^(2k+1) where P=A135880.at n=39A135894
• Triangle, read by rows equal to the matrix product R^-1*Q, where Q = A135885 and R = A135894; R^-1*Q equals triangle R shifted down one row.at n=48A135900
• The z^2 coefficients of the polynomials in the GF3 denominators of A156927 divided by 2.at n=6A157707
• Denominator of Bernoulli(n, 1/7).at n=4A158475
• Square array read by antidiagonals: a(p,n) is the number of inversions in all p-ary words of length n on {0,1,2,...,p-1} (p>=2, n>=2).at n=39A181372
• Number of n X n symmetric (0,1)-matrices containing four ones.at n=20A185355
• Triangular array read by rows. T(n,k) is the number of connected endofunctions on {1,2,...,n} that have exactly k nodes in the unique cycle of its digraph representation.at n=23A201685
• Main transitions in systems of n particles with spin 3.at n=4A212701
• Triangle, read by rows, where T(n,k) = k!*C(n, k)*7^(n-k) for n>=0, k=0..n.at n=23A218017
• Triangular array read by rows. T(n,k) is the number of cycles in the digraph representation of all functions f:{1,2,...,n}->{1,2,...,n} that have length k; 1<=k<=n.at n=24A225213
• Number T(n,k) of endofunctions on [n] where the largest cycle length equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A241981
• Number of endofunctions on [n] where the largest cycle length equals 4.at n=3A246214