18252

Appears in sequences

• a(n) = n^2*(n+1).at n=26A011379
• Least term in period of continued fraction for sqrt(n) is 10.at n=29A031434
• Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .at n=47A052335
• Expansion of (1-x+x^2)/(1-2x+2x^2-x^3-x^4).at n=29A096750
• Number of points in the standard root system version of the D_3 (or f.c.c.) lattice having L_infinity norm n.at n=39A110907
• Powerful numbers (definition 1) sandwiched between twin primes.at n=8A113839
• Numbers k such that k * phi(k) is a cube.at n=29A114076
• Powerful(1) numbers (A001694) whose digit reversal is a square.at n=33A115689
• Exponential aspiring numbers.at n=31A127658
• In triangular peg solitaire, number of distinct feasible pairs starting with one peg missing and finishing with one peg.at n=35A130515
• In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.at n=35A130516
• a(n) = 12*n^2.at n=39A135453
• a(n) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, 3 or 4, for 0 <= k <= 4n.at n=3A144508
• Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k*n.at n=24A144510
• a(n) = Sum_{i=1..n} Sum_{j=1..n} Sum_{k=1..n} (i+j+k)!/(3!*i!*j!*k!).at n=4A144511
• Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n.at n=24A144512
• Averages of twin prime pairs k such that k*3 and k/3 are squares.at n=9A154671
• Integers of the form k = m^3+m^2 such that k-+1 are primes.at n=5A154733
• a(n) = 729*n^2 + 27.at n=5A158645
• Number of permutations of 1..n containing the relative rank sequence { 153624 } at any spacing.at n=3A159125