39990

Appears in sequences

• Smallest multiple of n whose digits sum to n.at n=30A002998
• a(n) = (n+2)*(n+1)*(n^2 + 7*n - 12)/24.at n=28A014309
• Number of aperiodic necklaces of n beads of 6 colors; dimensions of free Lie algebras.at n=7A032164
• Euler transform of A027656(n-1).at n=33A035528
• Numbers whose sum of the squares of divisors is also a square number.at n=17A046655
• Numbers k such that the sum of unitary divisors of k^2 is a square.at n=16A064498
• Smallest proper multiple of n with digit sum n.at n=29A069035
• Numbers whose set of base 6 digits is {0,5}.at n=42A097252
• Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k returns (i.e., down steps hitting the x-axis).at n=58A097612
• Indices of primes in sequence defined by A(0) = 89, A(n) = 10*A(n-1) - 21 for n > 0.at n=14A101075
• Number of closed walks of length n on the complete graph on 7 nodes from a given node.at n=7A109501
• Record gaps between prime quadruplets.at n=15A113404
• a(n) = floor(6^n/n).at n=6A129796
• Half the number of length n integer sequences with sum zero and sum of squares 9800.at n=3A157602
• a(n) = 100*n^2 - 10.at n=19A158490
• a(n) is the smallest number which is divisible by n, is not equal to n and its digital sum is also divisible by n.at n=29A163502
• Number of sequences of length n with terms from {0,1,...,n-1} such that the sum of terms is 0 modulo n and the i-th term is not i.at n=6A173499
• Number of n-length cycles from any point in a complete graph on n nodes.at n=5A185634
• Record (maximal) gaps between prime triples (p, p+4, p+6).at n=38A201596
• Number of n-bead necklaces of n colors not allowing reversal, with no adjacent beads having the same color.at n=6A208533