24234

Appears in sequences

• Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).at n=13A036893
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=17A049901
• a(n) = a(n-1) + 6*a(n-2), a(0)=1, a(1)=0.at n=10A102901
• Values of n such that n^a-+a are primes, a=5.at n=25A155021
• Generalized q-Stirling 2nd numbers (see A022166):q=3;m=2; t1(n, k, q_) = (1/(q - 1)^k)*Sum[(-1)^(k - j)*Binomial[k + n, k -j]*q-Binomial[j + n, j, q - 1], {j, 0, k}].at n=17A156824
• a(0)=1, a(1)=6, a(n)=13*a(n-1)-36*a(n-2) for n>1.at n=5A165314
• a(n) = floor((2*3^n+3*2^n)/5).at n=10A178936
• a(n) = n*(14*n - 11).at n=42A195021
• a(n) = Sum(P(i)*P(j), 1<=i<j<=n), where P(k) is the k-th Pell number A000129(k).at n=7A213785
• a(n) is the largest possible integer value for sqrt(0 _ 1 _ 2 _ ... _ n), where one is allowed to place any mixture of +'s and *'s in the n blank spaces.at n=20A304935
• a(n) is the largest possible integer value for sqrt(0 _ 1 _ 2 _ ... _ n), where one is allowed to place any mixture of +'s and *'s in the n blank spaces.at n=21A304935
• Triangle read by rows: T(n, k) = qStirling2(n, k, q) for q = 3, with 0 <= k <= n.at n=25A333143
• a(n) = Sum_{d|n} d * binomial(n,d).at n=13A367864