1118481

Appears in sequences

• sigma_4(n): sum of 4th powers of divisors of n.at n=31A001159
• Numerator of sum of -4th powers of divisors of n.at n=31A017671
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 16.at n=22A022180
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 16.at n=26A022180
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,0.at n=10A033114
• Sum of n-th powers of divisors of 32.at n=4A034665
• Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 10.at n=30A043868
• 3rd column of Family 1 "90 x 150 array": generations 0 .. n of Rule 150 starting from seed pattern 17.at n=8A048714
• a(n) = 111111 in base n.at n=15A053700
• a(n) = floor(8^8/n).at n=14A057070
• Numbers of the form (4^{mr}-1)/(4^r-1) for positive integers m, r.at n=26A076275
• Expansion of 1/((1-2*x)*(1-x^4)).at n=20A083593
• a(0) = 0 and a(n) = (5*(-4)^n + 16*(-1)^n + 9*4^n)/240 for n >= 1.at n=13A113968
• Expansion of 1/((1+x)*(1-2*x)*(1+x^2)).at n=21A115451
• G.f. x^2*(-1+x+x^2)/((1-x)*(2*x-1)*(x+1)*(x^2+1)).at n=24A115851
• Reduced numerators of 2*(2^(1+n)-1)/(1+n)/(2+n).at n=23A116419
• Decimal representation of n-th iteration of the Rule 54 elementary cellular automaton starting with a single black cell.at n=10A118108
• Partial sums of powers of 16.at n=5A131865
• T(n,k) = (k^n)*U(n, (1/k + k)/2), where U(n,x) is the n-th Chebyshev polynomial of the second kind, square array read by antidiagonals upward (n >= 0, k >= 1).at n=39A173588
• Triangle generated by T(n,k) = q^k*T(n-1, k) + T(n-1, k-1), with q=4.at n=22A176244