33504

Appears in sequences

• a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=45A023862
• a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=44A023870
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 91.at n=39A031589
• 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, 1, 0), (0, 1, -1), (1, -1, 0), (1, 0, 1)}.at n=9A149031
• Number of binary strings of length n with no substrings equal to 0010 0101 or 1011.at n=15A164495
• Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two clockwise edge increases.at n=3A205980
• Number of (n+1)X5 0..2 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=1A205982
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=11A205986
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=13A205986
• Number of defective 4-colorings of an n X 7 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..3 order.at n=9A229577
• a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3) - 4*a(n-4) + 4*a(n-5) - 4*a(n-6) + 4*a(n-7) - 4*a(n-8) + 4*a(n-9) - 3*a(n-10) + 2*a(n-11) - 3*a(n-12) + 2*a(n-13) for n >= 16, with initial values as shown.at n=25A288511
• a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).at n=48A304375
• Number of n X 2 0..1 arrays with every element unequal to 1, 2, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=12A305091
• Positions of Zuckerman numbers within A342978, the ordered list of zeroless numbers according to k/A007954(k).at n=13A343036