19142

Appears in sequences

• Hoggatt sequence with parameter d=8.at n=5A005366
• Numbers k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=23A006601
• Numbers k such that k through k+4 all have the same number of divisors.at n=3A049051
• Numbers k such that Pi^k - 1/phi is closer to its nearest integer than any value of Pi^j - 1/phi for 1 <= j < k.at n=12A080281
• Number of nX1 1..4 arrays with every element value z a city block distance of exactly z from another element value z.at n=16A209390
• Number of partitions of n having (sum of odd parts) > (sum of even parts).at n=40A239262
• Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1) and the transform T(x)-> (d_(k)+d_(k-1) mod 10)*10^(k-1) + (d_(k-1)+d_(k-2) mod 10)*10^(k-2) + ... + (d_(2)+d_(1) mod 10)*10 + (d_(1)+d(k) mod 10). Sequence lists the numbers x such that T(x) divides x.at n=13A244286
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=30A271166
• G.f.: Sum_{k>=0} A000009(k)^2 * x^k / Sum_{k>=0} A000041(k) * x^k.at n=48A305350
• a(0) = 1; a(n) = (2/n) * Sum_{k=0..n-1} binomial(n,k)^2 * (n-k) * a(k).at n=5A335501
• a(0) = 1; thereafter a(n) = 10*n^2 - 5*n + 2.at n=44A383466