88909
domain: N
Appears in sequences
- Smallest number whose n-th power begins with n n's; n-th root of A068123.at n=4A068124
- Duplicate of A068124.at n=4A077738
- Row sums of A078939.at n=6A078945
- Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^2 equal to n^2*49.at n=23A184245
- Number T(n,k) of entries in the k-th cycles of all permutations of [n] when cycles are ordered by increasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=40A322383
- Irregular table whose rows list the nontrivial cycles of the ghost iteration A329201, starting with the smallest member.at n=22A329342
- Number of entries in the fifth cycles of all permutations of [n] when cycles are ordered by increasing lengths.at n=4A332909
- Square array T(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of e.g.f. exp(k*(exp(x) - 1) + x).at n=61A335975
- a(1) = 1; a(n+1) = Sum_{d|n} 3^(n/d - 1) * a(d).at n=11A355116
- Numbers with easy multiplication table - the first 9 multiples of these numbers can be derived by either incrementing or decrementing the corresponding digits from the previous multiple.at n=33A359925