28836

Appears in sequences

• Numbers that have exactly seven prime factors counted with multiplicity (A046308) whose digit reversal is different and also has 7 prime factors (with multiplicity).at n=17A109027
• Numbers k such that the concatenation of k with 4*k gives a square.at n=1A115535
• Expansion of psi(x^2)^8 * (psi(x)^8 + psi(-x)^8) / 2 in powers of x^2 where psi() is a Ramanujan theta function.at n=5A135828
• Number of n X 7 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope.at n=2A222968
• Table T(n,k) is the number of n X (k+1) 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope, read by downward antidiagonals.at n=30A222969
• Number of 3 X (n+1) 0..1 arrays with every row least squares fitting to a positive-slope straight line and every column least squares fitting to a zero- or positive-slope straight line, with a single point array taken as having zero slope.at n=5A222971
• Number of ways of writing n as the sum of 9 triangular numbers.at n=20A226253
• Number of length 3+2 0..n arrays with the sum of second differences multiplied by some arrangement of +-1 equal to zero.at n=10A250562
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 569", based on the 5-celled von Neumann neighborhood.at n=29A272993
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the expansion of continued fraction 1/(1 - k*x/(1 - k*x^2/(1 - k*x^3/(1 - k*x^4/(1 - k*x^5/(1 - ...)))))).at n=74A286933
• Take apart the sides of each of the integer-sided triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total volume of all rectangular prisms enclosed in this way.at n=33A308233
• a(0) = 0; a(n) = 3^(n-1) + (1/n) * Sum_{k=1..n-1} binomial(n,k)^2 * 3^(k-1) * (n-k) * a(n-k).at n=5A333982
• Number of ways to write n as an ordered sum of 6 nonzero decimal palindromes.at n=19A341203
• G.f. A(x) satisfies A(x) = 1 + x*(1-x^3)^3*A(x)^2.at n=11A389895