32738

Appears in sequences

• The number of n X n (0,1)-matrices with a 1-width of 2.at n=3A005020
• Second-order Eulerian numbers: a(n) = 2^n - 2*n.at n=15A005803
• Expansion of (1-x)^(-1)/(1 - x - 2*x^2 + 2*x^3).at n=25A077866
• a(n) = A078152(2^n).at n=27A078157
• Sum of first n 7-almost primes.at n=31A086059
• Sequence S with property that for n in S, a(n) = a(1) + a(2) +...+ a(n-1) and for n not in S, a(n) = n+1.at n=25A121173
• E.g.f.: (e^x - x)^2.at n=15A130102
• Partial sums of A000918, starting from index 1.at n=13A145654
• a(n) = 4*A061547(n+1) - 3*A166753(n).at n=13A166754
• Semiprimes sp such that sp plus its digit sum is a perfect square.at n=28A244733
• Number of length 3 arrays x(i), i=1..3 with x(i) in i..i+n and no value appearing more than 2 times.at n=30A250352
• Decimal representation of the n-th iteration of the "Rule 111" elementary cellular automaton starting with a single ON (black) cell.at n=7A267255
• Numbers that are the sum of fourth powers of three distinct positive integers in arithmetic progression.at n=29A306214
• Number T(n,k) of subsets of [n] with k binary carry-connected components; triangle T(n,k), n >= 0, 0 <= k <= A029837(n+1), read by rows.at n=67A306297
• The difference between number of even and number of odd Grassmannian permutations of size n.at n=30A356185
• a(n) is the minimum integer k such that the smallest prime factor of the n-th Fermat number exceeds 2^(2^n - k).at n=15A358684