64155

Appears in sequences

• a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 2,2,3.at n=18A049873
• Odd squarefree abundant numbers.at n=23A112643
• Odd unitary abundant numbers.at n=23A129485
• Triangular array read by rows: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=59A249100
• Primitive, odd, squarefree abundant numbers.at n=23A249263
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=45A298973
• Number of nX4 0..1 arrays with every element unequal to 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero.at n=11A305085
• Squarefree part of numerator of the squared area of the Heronian triangle with sequential prime sides whose shortest leg is prime(n).at n=11A334177
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=23A339938
• Odd nonexponential abundant numbers: odd numbers k such that A160135(k) > k.at n=37A348605
• Odd numbers k such that A360522(k) > 2*k.at n=23A360526
• Odd modified exponential abundant numbers: odd numbers k such that A241405(k) > 2*k.at n=23A379031