33756

Appears in sequences

• a(n) = (2*n+1)*(9*n+1).at n=43A033573
• Total number of parts in all partitions of n into relatively prime parts.at n=27A085410
• Number of solutions to rev(x^2)=rev(x)^2 below 10^n.at n=11A098690
• 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, 0), (-1, 0, 1), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=9A149341
• Number of n X 3 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=14A238807
• Number of length-n binary strings having a unique border.at n=15A334600
• E.g.f. A(x) satisfies A(x) = 1 - 2 * log(1-x) * A(-2 * log(1-x)).at n=4A355134
• Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives p values.at n=27A359742
• Number of integer partitions of n whose length is a semi-sum of the parts.at n=44A367394