20206

Appears in sequences

• Fibonacci sequence beginning 4, 18.at n=16A022384
• Triangle, read by rows, where row n forms a polynomial in y=3*k that generates diagonal n as k=0,1,2,... for n>=0; thus T(n,k) = Sum_{j=0..n-k} T(n-k,j)*(3*k)^j, with T(n,0)=T(n,n)=1.at n=31A113716
• Numbers such that the digital sum base 2 and the digital sum base 5 and the digital sum base 10 all are equal.at n=18A135125
• Numbers k such that (sum of base-2 digits of k) = (sum of base-10 digits of k) = 10.at n=33A152207
• Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 2 X n array.at n=9A219472
• Triangle read by rows: T(n,k) is the number of weighted lattice paths B(n) having k uudd strings.at n=34A247297
• Numbers k = concat(s,t) such that k = antisigma(s) + antisigma(t), where antisigma(x) = A024816(x).at n=3A251605
• Numbers k such that gcd(2*k^7+1, 3*k^3+2) > 1.at n=17A369153
• Triangle read by rows: T(n,k) = number of connected quartic graphs on n vertices with crossing number k for n >= 1, k >= 0.at n=54A390644