39040

Appears in sequences

• a(1) = 1; a(n) is the smallest integer greater than a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 2^n.at n=10A109670
• Composite numbers such that product_{i=1..k} (p_i/(p_i-1)) / sum_{i=1..k} (p_i/(p_i-1)) is an integer, where p_i are the k prime factors of n (with multiplicity).at n=14A227034
• Number of length 3+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=18A245872
• Number of (4+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=11A252536
• Number of n X 3 0..1 arrays with every element equal to 0, 2, 4, 5 or 7 king-move adjacent elements, with upper left element zero.at n=18A298570
• Sorted numbers of (undirected) Hamiltonian cycles in the graphs of the Archimedean solids.at n=8A343433
• Numerators of the convergents given by treating A072193 as continued fraction coefficients after the leading 0.at n=12A391714