20916

Appears in sequences

• Numbers whose base-12 representation has exactly 5 runs.at n=22A043654
• Molien series for complete weight enumerators of self-dual codes over Z/8Z.at n=15A092544
• a(n) is the smallest number m such that sigma(m)=n*pi(m), or 0 if no such m exists.at n=24A137602
• Triangle T, read by rows : T(n,k) = A007318(n,k)*A026641(n-k).at n=49A171650
• Numbers k such that k and k^3 are sums of two twin primes.at n=14A213811
• Number T(n,k) of n-length words w over a k-ary alphabet {a1, a2, ..., ak} such that #(w,a1) >= #(w,a2) >= ... >= #(w,ak) >= 1, where #(w,x) counts the letters x in word w; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=49A226874
• Number of n-length words w over a 4-ary alphabet {a1,a2,...,a4} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a4) >= 1, where #(w,x) counts the letters x in word w.at n=5A226883
• Triangle corresponding to the partition array of the M_1 multinomials (A036038).at n=39A292222
• Triangle read by rows. T(n,k) is the number of labeled threshold graphs on n vertices with k components, for 1 <= k <= n.at n=40A348436
• Array read by antidiagonals: T(n,k) is the number of nonisomorphic multisets of permutations of an n-set with k permutations.at n=59A362644
• Terms of A319928 that are congruent to 4 modulo 8: Numbers k == 4 (mod 8) such that there is no other m such that (Z/mZ)* is isomorphic to (Z/kZ)*, where (Z/kZ)* is the multiplicative group of integers modulo k.at n=18A372755
• Numbers k such that sopfr(k + sopfr(k)) = sopfr(k) + sopfr(sopfr(k)), where sopfr = A001414.at n=25A376851
• a(n) is the least k >= 2 such that (2^k - 1) mod (n*k - 1) = 0.at n=24A381923