55566

Appears in sequences

• Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan[AlnSi112-nO224] starting with a T4 atom.at n=14A019123
• a(n) = T(n,n-3), array T as in A047130.at n=9A047135
• Numbers whose product of exponents is equal to the sum of prime factors.at n=35A071175
• Digital sum of n = sum of palindromes from the smallest prime factor of n to the largest prime factor of n.at n=19A074310
• Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.at n=50A135021
• Partial sums of A000048.at n=20A173278
• Mobius transform of A008457.at n=41A190623
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=25A212863
• Numbers k such that k*product_of_digits(k) is a nonzero cube.at n=11A229544
• Floor(AGM(1, Fibonacci(n))), where AGM denotes the arithmetic-geometric mean.at n=28A234368
• a(n) = 6*n^3.at n=21A244726
• Numbers which have only digits 5 and 6 in base 10.at n=33A256291
• Larger of pairs (m, n), such that the difference of their squares is a cube and the difference of their cubes is a square.at n=6A261328
• G.f. A(x,y) satisfies: A( x - x*y*A(x,y), y) = x + x*(1-y)*A(x,y), where the coefficients T(n,k) of x^n*y^k form a triangle read by rows n>=1, for k=0..n-1.at n=40A291820
• Central terms of triangle A291820.at n=4A291821
• a(n) = Sum_{k=1..n^2, gcd(n,k) = 1} k.at n=20A308474
• a(n) = n^3 if n odd, 3*n^3/4 if n even.at n=42A309337
• a(n) = Sum_{k=0..floor(n/2)} n^k * |Stirling1(n,2*k)|.at n=7A357683
• Least of the smoothest two-nonzero-digit numbers of length n.at n=3A370849
• Irregular triangle read by rows: T(r,c) is the product of the number of standard Young tableaux (A117506) and the number of semistandard Young tableaux (A262030) for partitions of r.at n=38A380611