19665

Appears in sequences

• Expansion of e.g.f. theta_3^(15/2).at n=4A015673
• Number of primes == 3 (mod 10) less than 10^n.at n=5A073506
• Expansion of e.g.f.: cosh(sqrt(2)*x)*(1+exp(x)).at n=12A088014
• Number of (k+1)-tuples of integers modulo n (x_1,...,x_k,s) such that at least one subset of the x_i sums to s mod n. In other words, n^k times the expected number of distinct subset sums mod n of k integers mod n chosen uniformly at random. Read by antidiagonals, i.e., with entries in the order (n,k)=(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...at n=47A098966
• Ratio of quadruple Sum of k^2-1 to quadruple sum of k made into an integer sequence: (1/6)*(-1 + n)*(2 + n)*(3 + n)*(7 + n).at n=15A130863
• a(n) = 3^n - 2*n.at n=9A186948
• Number of (w,x,y,z) with all terms in {1,...,n} and w>=average{x,y,z}.at n=14A212089
• Number of nX3 arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nX3 array.at n=2A217996
• T(n,k)=Number of nXk arrays of the minimum or maximum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.at n=12A217999
• a(n) = Sum_{i=0..n} digsum_9(i)^3, where digsum_9(i) = A053830(i).at n=50A231686
• Frequency of the most common final digit of a prime < 10^n.at n=5A244265
• Number of (n+1)X(2+1) 0..2 arrays with each row and column prime, read as a base 3 number with top and left being the most significant digits.at n=5A262118
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column prime, read as a base 3 number with top and left being the most significant digits.at n=22A262122
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with each row and column prime, read as a base 3 number with top and left being the most significant digits.at n=26A262122
• Expansion of Product_{k>=1} 1/(1-x^(k+6))^k.at n=42A263362
• Number of ordered pairs of integer partitions of n where no part of the first is greater than any part of the second.at n=23A322439
• Numbers that are the sum of four third powers in six or more ways.at n=21A345148
• Numbers that are the sum of four third powers in exactly six ways.at n=18A345149
• Number of ways to place a non-attacking black king and white king on an n X n board, up to rotation and reflection.at n=20A357723
• a(1) = 1; a(n) = -Sum_{k=2..n} k^3 * a(floor(n/k)).at n=25A360658