24278

Appears in sequences

• a(n) = floor(Fibonacci(n)/5).at n=26A004698
• Representation degeneracies for Neveu-Schwarz strings.at n=26A005295
• a(0) = 1, a(n) = 21*n^2 + 2 for n>0.at n=34A010011
• Expansion of (1+3*x+9*x^2+12*x^3+11*x^4+3*x^5+x^6)/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=19A055383
• a(n) = sum of terms of {a(1),a(2),a(3),...a(n-1)} which are coprime to n.at n=30A096217
• a(n) = floor(L^3*{phi^(3*n-2), phi^(3*n-1), phi^(3*n-2) + phi^(3*n-1)}) where L = (1 + sqrt(5))/(2*sqrt(5)) and phi = (1 + sqrt(5))/2.at n=22A115315
• Expansion of g.f.: -1/(-1 + x + x^4 - x^10 + x^13 + x^14).at n=34A174578
• a(n) = Sum_{k=1..n} k*k', where n' is the arithmetic derivative of n.at n=46A190117
• Triangle read by rows, k!*s_2(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.at n=23A225475
• a(n) = number of steps to reach 0 when starting from k = (n^3)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=58A261228