24572

Appears in sequences

• Start with 1, then alternately double or add 2.at n=25A099942
• Binomial transform of [1, 1, 5, 1, 5, 1, 5, ...].at n=13A131128
• Partial sums of A200675.at n=49A200678
• a(0)=0, a(1)=1, for n>1, a(n) = n<*>n, where k<*>m = k<+>k<+>...<+>k is the m-1-fold iteration of the operation <+> defined in A206853.at n=12A206960
• Number of pairs (x, y) with 0 <= x, y <= n such that the distance between two points is a positive integer.at n=24A228108
• a(n) is one fourth of the total number of free ends of 4 line segments expansion at n iterations (see Comments lines for definition).at n=25A238549
• Expansion of x*(1 - x + 4*x^2) / ((1 - x)*(1 - 2*x)).at n=14A296954
• Number of n X 3 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=10A299874
• a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.at n=25A347789
• a(n) is the largest number t such that there exist numbers i,j,k such that, for all m <= t, there exist integers x,y,z with x*i + y*j + z*k = m and |x|+|y|+|z| <= n.at n=39A383579