35650

Appears in sequences

• Expansion of Product_{m>=1} (1+x^m)^A000009(m).at n=25A050342
• Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=19A054208
• Numbers n such that n | 5^n + 4^n + 3^n.at n=31A057236
• A diagonal of A008296.at n=22A059302
• Number of (n+1) X 3 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=30A184064
• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, three, four, five, six or eight distinct values for every i,j,k<=n.at n=6A211594
• a(n) = pg(n, 3) + pg(n, 4) + ... + pg(n, n) where pg(n, m) is the m-th n-th-order polygonal number.at n=22A245679
• Number of orbits of Aut(Z^7) as function of the infinity norm n of the representative lattice point of the orbit, when the cardinality of the orbit is equal to 80640.at n=25A266396
• Numbers m having greatest prime power divisor d such that d is smaller than the difference between m and the largest prime smaller than m and d is smaller than the difference between m and twice the largest prime smaller than m/2.at n=13A290290
• Primitive abundant numbers version 2 (abundant numbers all of whose proper divisors are deficient numbers) and increasing any prime factor in the prime factorization gives a non-abundant number when factored back.at n=31A335557
• Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments.at n=17A352739