42735

Appears in sequences

• a(n) = binomial(n+2, 2) + binomial(n+4, 5).at n=20A027658
• Odd numbers with exactly 5 distinct prime factors.at n=15A046391
• Triangle of Stirling numbers of order 3.at n=20A059022
• a(n) = (2*n+1)*(2*n+3)*(2*n+5).at n=16A061550
• Odd squarefree abundant numbers.at n=13A112643
• Odd unitary abundant numbers.at n=13A129485
• a(n) = (4*n+1)*(4*n+3)*(4*n+5).at n=8A133766
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=24A146960
• Number of Fibonacci integers in the interval [1, 10^n].at n=5A185060
• Triangle of coefficients of polynomials v(n,x) jointly generated with A210866; see the Formula section.at n=49A210867
• Number of (w,x,y,z) with all terms in {1,...,n} and w <= x > y <= z.at n=21A212246
• Least positive number k such that k*n written in base 10 is either a repunit or of the form 1111....0000.at n=25A244927
• Primitive, odd, squarefree abundant numbers.at n=13A249263
• a(n) is the number of ways of putting n labeled balls into 3 indistinguishable boxes such that each box contains at least 3 balls.at n=3A272982
• a(n) = the smallest number k such that k*n is a number with a string of 1's followed by a string of 0's.at n=25A276348
• Expansion of x*(1 + 3*x + x^2)/((1 - x)^5*(1 + x)^4).at n=40A287143
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=32A298973
• Signed recurrence over binary strict trees: a(n) = 1 - Sum_{x + y = n, 0 < x < y < n} a(x) * a(y).at n=45A300866
• Numbers that are the average of more pairs of distinct twin primes than any previous number.at n=35A335992
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=13A339938