19408

Appears in sequences

• Number of bipartite partitions.at n=15A002764
• Number of partitions of n with equal nonzero number of parts congruent to each of 0, 3 and 4 (mod 5).at n=57A035587
• Numerators of continued fraction convergents to sqrt(817).at n=6A042576
• Numbers k such that 129*2^k-1 is prime.at n=36A050590
• G.f.: A(x) = exp( 2*Sum_{n>=1} 2^n/A006519(n) * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=12A162588
• Triangle T(n,k), read by rows, given by (2,1/2,-1/2,0,0,0,0,0,0,0,...) DELTA (2,-1/2,1/2,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938.at n=39A201972
• Number of nX5 arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out straight through or left turns.at n=1A221897
• T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out straight through or left turns.at n=16A221898
• Number of 2 X n arrays of occupancy after each element stays put or moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out straight through or left turns.at n=4A221899
• Number of nX7 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 3.at n=16A239360
• Number of 2Xn 0..3 arrays with no element equal to zero plus the sum of elements to its left or one plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=15A241307
• Numbers missing from A001033 despite satisfying the necessary congruence conditions (see comments).at n=28A274470
• 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=16A283886
• 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=18A283886
• 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=33A283886
• p-INVERT of (0,0,0,1,2,3,4,5,...), the nonnegative integers A000027 preceded by two zeros, where p(S) = 1 - S - S^2.at n=21A290992
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + 2*b(n-2) - b(n-3), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295361
• a(n) is the unique number m such that A034460(m) = A357324(n).at n=42A357325