19397

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=38A024590
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=40A024599
• Number of n-dimensional partitions of 6.at n=13A042984
• Antidiagonal sums of table A083362.at n=33A083364
• Odd numbers producing 4 odd numbers in the Collatz iteration.at n=31A198587
• Fibonacci sequence beginning 14, 11.at n=16A206605
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 382", based on the 5-celled von Neumann neighborhood.at n=7A271540
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+19395) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=2A283886
• Expansion of Product_{k>=1} 1/(1-x^(k^2))^(k^2).at n=37A291655