33896

Appears in sequences

• Number of one-sided polyominoes with n cells.at n=11A000988
• Numbers n such that 249*2^n-1 is prime.at n=19A050883
• Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.at n=19A099771
• Rectangular table, read by antidiagonals, where the g.f.s of row n, R(x,n), satisfy: R(x,n+1) = R(G(x),n) for n>=0 and x*R(x,0) = G(x) = x + x*G(G(x)) is the g.f. of A030266.at n=52A128325
• Row 2 of table A128325.at n=7A128327
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (1, -1), (1, 1)}.at n=9A151466
• Floor(1/{(7+n^4)^(1/4)}), where {}=fractional part.at n=38A184631
• Number of one-sided polyominoes with 2n-1 cells.at n=5A210989
• Number of (w,x,y,z) with all terms in {1,...,n} and w*x<=y*z+2.at n=16A212055