33747

Appears in sequences

• Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves.at n=33A055364
• Inrepfigit (INverse REPetitive FIbonacci-like diGIT) numbers (or Htiek numbers).at n=13A128546
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, -1, 1), (-1, 0, 0), (1, 1, 0)}.at n=10A149081
• Define a pair of sequences c_n, d_n by c_0=0, d_0=1 and thereafter c_n = c_{n-1}+d_{n-1}, d_n = c_{n-1}+4*n+2; sequence here is c_n.at n=17A192751
• Number of arrays of -1..1 integers x(1..n) with every x(i) in a subsequence of length 1, 2 or 3 with sum zero.at n=11A193695
• Consider the digit reverse of a number x. Take the sum of these digits and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to x.at n=23A289868
• a(n) = 33*2^n - 45 (n>=1).at n=9A304514
• Number of nX5 0..1 arrays with every element unequal to 0, 1, 3, 4 or 8 king-move adjacent elements, with upper left element zero.at n=10A305249
• Number of multiset partitions of uniform integer partitions of n in which all parts have the same length.at n=46A320451