29820

Appears in sequences

• a(n) = n*(n+1)*(2*n+1)/3.at n=35A006331
• Number of rooted trees with n nodes with every leaf at height 8.at n=20A048813
• McKay-Thompson series of class 14A for Monster.at n=17A058497
• Number of orbits of length n in map whose periodic points come from A006954.at n=55A060479
• Triangle read by rows: T(n,k) is number of peakless Motzkin paths of length n and having k UHH...HD's starting above level 0, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=44A098073
• 1/12 of product of three numbers: n-th prime, previous and following number.at n=18A127921
• McKay-Thompson series of class 14A for the Monster group with a(0) = 1.at n=17A134782
• Lower triangular array called S1hat(5) related to partition number array A144890.at n=22A144891
• Second column (m=2) of triangle A144891 (S1hat(5)).at n=5A144893
• Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=21A201545
• Sum of the parts in the partitions of 4n into 4 parts with smallest part equal to 1 minus the number of these partitions.at n=17A239057
• Numbers k such that 11^phi(k) == 1 (mod k^2), where phi(k) = A000010(k).at n=23A253016
• Integers n such that n^2 = 2*x*(y-x), where x and y are consecutive terms in A014574.at n=24A255230
• Even numbers such that the sum of the even divisors and the sum of the odd divisors are a square or a cube.at n=22A263695
• a(n) = a(n-1) + a(n-2) - n*a(floor(n/2)), where a(0) = 1, a(1) = 2, a(2) = 3.at n=18A298401
• Number of maximal antichains of nonempty, non-singleton subsets of {1..n}.at n=6A326360
• Numbers k such that psi(k^2) = k, psi = A002322; indices of 1 in A341857.at n=34A341858
• Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a primorial number (A002110).at n=37A353980
• Triangle read by rows: the coefficients of polynomials (1/3^(m-n)) * Sum_{k=0..m} k^n * 2^(m-k) * binomial(m,k) in the variable m.at n=50A383140