18357

Appears in sequences

• Rounded base-3 logarithm of A082126(n).at n=26A082127
• Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k UDUU's, 0 <= k <= floor((n-1)/2).at n=33A116424
• The first 10 digits of the cube root of n contain the digits 0-9.at n=5A119517
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+119)^2 = y^2.at n=28A129837
• Number T(n,k) of Dyck paths of semilength n having exactly k (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1); triangle T(n,k), n>=0, read by rows.at n=47A243752
• Number of Dyck paths of semilength n having exactly two (possibly overlapping) occurrences of the consecutive step pattern given by the binary expansion of n, where 1=U=(1,1) and 0=D=(1,-1).at n=9A243771
• a(n) = number of steps required to reach 0 from F(n+2) by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...at n=24A261082
• Number of surviving (but not bifurcating) nodes at generation n in the binary tree of persistently squarefree numbers (see A293230).at n=34A293521
• Nonprime numbers k of the form 4*m+1 such that Sum_{j=0..k-1} 2^j * binomial(3*j, j) == 1 (mod k).at n=28A373747