37910

Appears in sequences

• a(n) = S(n) + c(n) where S(n) = [ (3/2)^n ] and c is the complement of S.at n=25A022808
• Engel expansion of zeta(3) = 1.20206... .at n=8A053980
• Number of binary strings u of any length with property that length(u) + number of 0's in u <= n (only one of a string and its reversal are counted).at n=21A066067
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k.at n=46A109158
• Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined below in Comments.at n=17A192755
• Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639).at n=37A242489
• Number of n X n 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A303618
• Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A303621
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=40A303624
• Number of 5Xn 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A303627
• Sequence lists numbers k > 1 such that k^4 == d(k) (mod sigma(k)), where d = A000005 and sigma = A000203.at n=27A323251