24444
domain: N
Appears in sequences
- Inflation orbit counts.at n=20A031367
- Numbers having four 4's in base 10.at n=2A043508
- Number of triangular regions in regular n-gon with all diagonals drawn.at n=33A062361
- Number of partitions of n into distinct partition numbers.at n=27A068006
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum for each group.at n=35A074128
- Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists.at n=42A083958
- a(n) is the least k, not multiple of 10, such that k^k contains a palindromic substring of length n.at n=17A115943
- Smallest natural number requiring n letters in Spanish.at n=40A161353
- a(n) = name of smallest positive number in Spanish which has the letter E in the n-th position starting from the end, or -1 if no such number exists.at n=41A173182
- Number of nX3 0..1 arrays with every element equal to 1, 3, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=12A298617
- a(n) = n*(n + 1)*(7*n + 5)/6.at n=27A304993
- a(n) = 2*n*(7*n - 3).at n=42A316466
- G.f. A(x) satisfies: [x^(n-1)] (1+x)^(n^3) / A(x)^(n^2) = 0 for n>1.at n=4A319143
- Number of walks of length 4n in the first octant using steps (1,1,1), (-1,0,0), (0,-1,0), and (0,0,-1) that start and end at the origin.at n=3A340540
- Number of n*(n+1)-step n-dimensional nonnegative closed lattice walks starting at the origin and using steps that increment all components or decrement one component by 1.at n=3A340590
- Number A(n,k) of n*(k+1)-step k-dimensional nonnegative closed lattice walks starting at the origin and using steps that increment all components or decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=24A340591
- Number of ways to write n as an ordered sum of nine powers of 2.at n=26A342252
- 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=21A372755
- Define f(x) = abs(1-1/x) and sequence {b(m)} such that b(m+1) = f(b(m)). a(n) is the number of initial values b(1) such that {b(m)}'s period has length n.at n=20A378853