1015808

Appears in sequences

• Expansion of g.f. (1+2*x)/(1-2*x)^2.at n=15A014480
• Numbers n such that uphi(sigma(n)) = n, where the uphi is the unitary phi function A047994.at n=31A030164
• Numbers k such that d(k)^3 divides k.at n=16A046755
• Jordan function J_5(n).at n=15A059378
• Number of strings over Z_4 of length n with trace 0 and subtrace 0.at n=11A068620
• Number of strings over Z_4 of length n with trace 0 and subtrace 2.at n=11A068774
• a(n) = n^4 - n^3.at n=32A085537
• a(n) = n*(n + 1)^3.at n=31A085540
• Inverse binomial transform of n*Pell(n).at n=31A093968
• a(n) = 2^(n-1)*A047240(n).at n=16A128205
• a(n) = n*2^(floor(n/2)).at n=31A132344
• Binomial transform of [1, 2, -3, -4, 5, 6, -7, -8, 9, 10, ...].at n=31A140230
• Monotonic ordering of nonnegative differences 4^i-8^j, for 40>= i>=0, j>=0.at n=35A192167
• Number of solutions to Sum_{i=1..n} x_i^2 == 0 (mod 4) with x_i in 0..3.at n=10A228920
• a(1) = 1, a(2) = 2, a(3) = 5, a(4) = 8 and a(5) = 15, a(n) = Sum_{j=1..n-1} a(j).at n=20A257548
• Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 4) with x_i in 0..3, where n >= 0 and 0 <= k <= 3.at n=44A330619
• Array read by rows: T(n,k) is the number of solutions to the equation Sum_{i=1..n} x_i^2 == k (mod 4) with x_i in 0..3, where n >= 0 and 0 <= k <= 3.at n=47A330619
• E.g.f. A(x) satisfies A(x) = 1 + 2 * x * A(log(1+x)).at n=8A355104
• Number of minimum connected dominating sets in the n-flower graph.at n=30A382500
• Expansion of e.g.f. cosh(x)^2*(1 + x + x^2/2).at n=16A386227