40908

Appears in sequences

• Sum of 11 positive 9th powers.at n=26A004800
• a(n) = Sum_{k<n, k!==0 (mod n)} k!/n.at n=9A110416
• Smith numbers of order 3.at n=11A178213
• Number of length n binary words that contain 000 and 001 and 010 and 011 and 100 and 101 and 110 and 111 as contiguous subsequences. The 3 letter subsequences are allowed to overlap.at n=7A242167
• Number of n X n 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once.at n=2A269102
• Number of n X 3 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once.at n=2A269104
• T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once.at n=12A269109
• Number of sets of nonempty words with a total of n letters over ternary alphabet containing the third letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A293884
• Triangle read by rows. T(n, k) = A000566(n - k + 1) * T(n, k - 1) + T(n - 1, k) for 0 < k < n. T(n, 0) = 1 and T(n, n) = T(n, n - 1) if n > 0.at n=30A366149
• Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge.at n=51A368924