23631

Appears in sequences

• Number of Carmichael numbers (A002997) less than 2^n.at n=43A225005
• a(n) = round((5^n)*4 / 3^n).at n=17A228079
• Expansion of 1/((1-x)*((1-5*x)^2)*(1-8*x)).at n=4A229026
• Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 4*n + 3.at n=16A257621
• Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 4*n + 3.at n=19A257621
• Number of squares after the n-th generation in a symmetric (with 45-degree angles) non-overlapping Pythagoras tree.at n=19A276647
• Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=8A299245
• Lexicographically earliest sequence of distinct nonprime terms that turns into a sequence of distinct prime numbers when the "slide the digits, don't touch the commas" operation is applied (see the Comments and Example sections).at n=55A330367
• Number of compositions of n containing at least one part p of multiplicity p.at n=17A336273