48685

Appears in sequences

• Number of 5-ary rooted trees with n nodes and height exactly 4.at n=22A036635
• 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=40A113716
• a(1)=1; for n>1, a(n) = a(n-1) + n^0 if n odd, a(n) = a(n-1) + n^3 if n is even.at n=24A135332
• Number of nX2 0..2 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=18A201426
• Tetraprimes (or products of exactly four distinct prime numbers) that are the sum of two successive tetraprimes.at n=20A380348