30429

Appears in sequences

• Expansion of 1/Product_{m>=1} (1 - m*q^m)^23.at n=4A022747
• Numbers k such that k | 11^k + 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k.at n=43A057286
• a(n)=x is the smallest number such that gcd(prime(x)-1, x) = n.at n=48A084313
• Same triangle as A106243, but with rows read in boustrophedon manner, i.e., in the order in which they were created.at n=40A106242
• Triangle read by rows from left to right. However, triangle is constructed in the boustrophedon way, reading alternately right to left and left to right. Top entry is 1. In all later rows, initial entry is 0, other entries are sum of previous entry in that row plus sum of two entries above it in previous row.at n=40A106243
• a(n) = NumberOfPartitions(n) * ( tau(n)-1 ).at n=32A141670
• 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.at n=42A152777
• Irregular triangle read by rows: T(n,k), n >= 2, 1 <= k <= n/2, = number of rooted forests with n nodes and k trees, with at least two nodes in each tree.at n=58A174135
• Numbers x such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of sigma(x) and all cyclic permutations of Euler totient function phi(x).at n=39A247317
• Integers n such that 10^n + 5^n + 2^n is a prime.at n=11A276741
• The greater of the lexicographically least pair (x, y) such that 0 < x < y and sigma(x) = sigma(y) = n + x + y.at n=11A285890
• a(n) = 3*p(n), where p(n) is the number of partitions of n.at n=33A299473
• Number of non-isomorphic multiset partitions of size n such that the blocks have empty intersection.at n=10A317757
• Starting at n, a(n) is the number of times we move from a positive spot to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=25A324684
• Numbers that are the sum of four third powers in seven or more ways.at n=17A345150
• Numbers that are the sum of four third powers in eight or more ways.at n=2A345152
• Numbers that are the sum of four third powers in exactly eight ways.at n=1A345153
• a(n) = A351477(n) * FA where F is the Fermat point of a primitive integer-sided triangle ABC with A < B < C < 2*Pi/3 and FA + FB + FC = A336329(n).at n=9A351801
• a(n) is the smallest nonnegative integer k where there are exactly n nonnegative integer solutions to x^2 + 5*y^2 = k.at n=12A374288