26816

Appears in sequences

• Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(2,8).at n=7A018916
• Numbers n such that z(n) and z(n+1) are both prime, where z(n) = a^d + b^d + c^d + ..., where a*b*c* ... is the prime factorization of n and d is the largest digit of n.at n=20A109280
• Number of degree-n permutations such that number of cycles of size k is odd (or zero) for every k.at n=8A130263
• Number of arrangements of n+1 nonzero numbers x(i) in -2..2 with the sum of floor(x(i)/x(i+1)) equal to zero.at n=7A189491
• T(n,k)=Number of arrangements of n+1 nonzero numbers x(i) in -k..k with the sum of floor(x(i)/x(i+1)) equal to zero.at n=43A189498
• Number of arrangements of 9 nonzero numbers x(i) in -n..n with the sum of floor(x(i)/x(i+1)) equal to zero.at n=1A189505
• a(n) = n*(5*n^2 - 3*n + 4) / 6.at n=32A203552
• Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=10A252528
• Number of 2Xn 0..1 arrays with every element equal to 0, 2, 3 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=10A302368
• Composites k such that the concatenation of the prime factors of k, with multiplicity, in some order is divisible by k.at n=44A322843
• Main diagonal of A332361.at n=21A332362
• Expansion of e.g.f. (1/x) * Series_Reversion( x * exp(-x*exp(2*x)) ).at n=5A380972
• E.g.f. A(x) satisfies A(x) = exp(x*A(x)/A(-x*A(x)^4)^2).at n=5A384983
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A384983.at n=26A384986
• Consecutive states of the linear congruential pseudo-random number generator (1277*s + 24749) mod 117128 when started at s=1.at n=3A385357