28014

Appears in sequences

• a(n) = 2*a(n-1) + 4*a(n-2) - 6*a(n-3) - 3*a(n-4).at n=14A136201
• Number of possible paths to each node that lies along the edge of a cut 4-nomial tree, that is rooted one unit from the cut.at n=10A166135
• "Early bird" squares: write the square numbers in a string 149162536496481100... . Sequence gives numbers k such that k^2 occurs in the string ahead of its natural place.at n=46A181585
• Modular recursion: a(0)=a(1)=a(2)=a(3)=1, thereafter: a(n) equals a(n - 2) + a(n - 3) when n = 0 mod 5, a(n - 1) + a(n - 3) when n = 1 mod 5, a(n - 1) + a(n - 2) when n = 2 mod 5, a(n - 1) + a(n - 4) when n = 3 mod 5, and a(n - 1) + a(n - 2) + a(n - 3) otherwise.at n=29A206012
• G.f. satisfies: A(x) = 1 + x^2 + x^2*A'(x)/A(x).at n=9A245119
• a(n) = n*(n + 1)*(7*n + 11)/6.at n=28A255687
• Triangle read by rows related to Catalan triangle A009766.at n=48A293944
• Triangle read by rows related to Catalan triangle A009766.at n=51A293944
• T(n,k) is (1/n) times the n-th derivative of the difference between the k-th tetration of x (power tower of order k) and its predecessor at x=1; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=31A295027
• a(n) = period length of the sequence A020639(n^k - 1), k >= 1.at n=71A368811
• a(n) = period length of the sequence A020639(n^k - 1), k >= 1.at n=81A368811