20650

Appears in sequences

• Triangle giving T(n,k) = number of (n,k) labeled rooted Greg trees (n >= 1, 0<=k<=n-1).at n=18A048160
• a(1) = 1; a(n+1) = sum of terms in continued fraction for the sum of the continued fractions, [a(1); a(2), a(3), ..., a(n)] and [0; a(1), a(2), a(3), ..., a(n)].at n=18A058082
• Number of arrays in [1..6]^n with adjacent elements differing by three or less.at n=6A126474
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 6.at n=51A136898
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=9A148865
• Sizes of successive increasing gaps between 2-pseudoprimes.at n=16A175738
• T(n, k) = [x^k] Sum_{j=0..n} j!*binomial(x, j), for 0 <= k <= n, triangle read by rows.at n=50A176663
• Wiener index of the n-web graph.at n=24A180576
• Number of (n+1)X2 0..1 arrays with permanents of 2X2 subblocks differing from neighboring permanents.at n=20A204543
• Integers that are Rhonda numbers to base 18.at n=5A255735
• Array read by antidiagonals: T(m,n) = number of m-ary words of length n with adjacent elements differing by 3 or less.at n=38A285267
• E.g.f. satisfies A(x) = 1/(1 - x * exp(x*A(x)))^2.at n=5A377541