36225

Appears in sequences

• Least sum of 4 distinct positive cubes in exactly n ways.at n=8A025421
• Number of partitions of n with some part repeated.at n=40A047967
• Triangle read by rows, the Bell transform of n!*binomial(5,n) (without column 0).at n=24A049411
• Generalized unsigned Stirling1 triangle, S1p(7).at n=17A134141
• Triangle H(n,j) (n=1,2,3,..., j=2,3,4,...) read by rows: let X(k,l,n) := Stirling2(n,k)*Stirling2(k,l) for 1<=k<=n and 1<=l<=k. Then H(n,j)= sum_{k+l=j, 1<=k<=n and 1<=l<=k} X(k,l,n).at n=55A136206
• Sum of all parts of all partitions of n minus the number of partitions of n.at n=23A182724
• a(n) = Sum_{0<j<n} n^3-j^3.at n=13A206808
• Sequence based on factorial representation converging to 1 in 2-adic numbers, and 0 in p-adic numbers for any other p.at n=7A227772
• Triangle T read by rows: T(n, m), for n >= 2, and m=1, 2, ..., n-1, equals the positive integer solution x of y^2 = x^3 - A(n, m)^2*x with the area A(n, m) = A249869(n, m) of the primitive Pythagorean triangle characterized by (n, m) or 0 if no such triangle exists.at n=98A278711
• Number of n X 4 0..1 arrays with every element equal to 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=7A298129
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero.at n=58A298133
• Numbers that are the sum of four third powers in nine or more ways.at n=1A345146
• Numbers that are the sum of four third powers in seven or more ways.at n=36A345150
• Numbers that are the sum of four third powers in eight or more ways.at n=9A345152
• Numbers that are the sum of four third powers in ten or more ways.at n=1A345155
• Numbers that are the sum of four third powers in exactly ten ways.at n=1A345156
• Total number of distinct numbers that can be obtained by starting with 1 and applying the "Choix de Bruxelles", version 2 operation at most n times in ternary (base 3).at n=12A356715
• Odd numbers k such that A162296(k) > 2*k.at n=19A357607
• a(n) = coefficient of x^n in A(x) such that: 0 = Sum_{n=-oo..+oo} x^(7*n) * (x^n - 2*A(x))^(8*n+1).at n=4A358957
• Terms of A363691 with a record number of divisors.at n=11A363693