19710

Appears in sequences

• Number of permutations of [n] in which the longest increasing run has length 6.at n=9A000467
• Theta series of E_6 lattice.at n=18A004007
• Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.at n=50A008304
• a(n) = n OR n^3 (applied to ternary expansions).at n=26A008469
• a(n) = n^3 + n.at n=27A034262
• Coefficients of cluster series for site percolation problem on f.c.c. lattice with 1st, 2nd and 3rd neighbor bonds.at n=3A036400
• Sums of 2 distinct powers of 3.at n=39A038464
• a(n) = Sum_{d|n, d=3 mod 4} d^3.at n=26A050454
• a(n) = Sum_{d|n, n/d=1 mod 4} d^3.at n=26A050462
• Sums of two powers of 3.at n=48A055235
• a(n) = n^3+n for odd n, (n^3+n)*3/2 for even n: Row sums of A093915.at n=26A093917
• Taylor series of a recursively defined function.at n=18A109087
• Triangle read by rows: T(n,k) = the number of ascending runs of length k in the permutations of [n] for k <= n.at n=50A122843
• a(n) = n^3 plus sum of digits of n^3.at n=26A123135
• Numbers k such that 2*k-1, 4*k-1, 6*k-1 and 8*k-1 are primes.at n=16A124487
• a(1)=1. a(n+1) = sum a(k), where the sum is over all positive integers k, k <= n, where each positive integer <= k and coprime to k is also coprime to n.at n=20A124693
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=8.at n=33A135193
• a(n) = n^9+9n.at n=3A180359
• Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 1 1 vertically.at n=7A207876
• The Wiener index of the meta-polyphenyl chain with n hexagons (see the Dou et al. and the Deng references).at n=9A216110