38340
domain: N
Appears in sequences
- Numbers k that, when expressed in base 5 and then interpreted in base 9, give a multiple of k.at n=33A062931
- Sum of squares of numbers that cannot be written as t*n + u*(n+1) for nonnegative integers t,u.at n=8A076389
- Triangle read by rows: T(n,m) = number of 3-uniform T_0-hypergraphs with n distinct edges and m vertices(n>=3, 1<=m<=2*n+1).at n=32A093854
- Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 41 for n > 0.at n=11A101960
- Numbers n such that sigma(n) = 12*phi(n).at n=6A104902
- Number of 0..n arrays x(0..3) of 4 elements without any two consecutive increases.at n=13A200786
- Record (maximal) gaps between prime triples (p, p+4, p+6).at n=37A201596
- T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=37A230469
- Number of 2 X n 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero.at n=7A230470
- Number of (n+2) X (6+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=21A252717
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood.at n=39A270463
- Exponential (2,4)-perfect numbers: numbers m such that esigma(esigma(m)) = 4m, where esigma(m) is the sum of exponential divisors of m (A051377).at n=17A328133
- Expansion of Product_{k>=1} (1 + x^k * (k + x)).at n=21A336979
- Triangle read by rows: T(n,k) is the number of digraphs on n labeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)^2.at n=28A350793
- Indices of records in A371921: numbers k such that A371921(k) > A371921(m) for all m < k.at n=14A371922
- Number of ways to partition digits 0-9 into signed terms in decreasing absolute value order with sum n.at n=10A389952