19094

Appears in sequences

• From George Gilbert's marks problem: jumping 6 marks at a time (final positions).at n=12A019996
• a(n) = 2*a(n-2) + a(n-3) + a(n-4) for n>=4, a(n) = binomial(n,3) for n<4.at n=23A240607
• a(n) = Least integer k such that A249431(k) = n, and -1 if no such integer exists.at n=26A249430
• Number of terms of A069090 with exactly n digits.at n=5A276707
• Integers m of the form m = 3*p + 5*q = 5*r + 7*s where {p,q} and {r,s} are pairs of consecutive primes.at n=8A283392
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2 or 4 king-move adjacent elements, with upper left element zero.at n=16A297888
• Indices k where k/A109812(k) reaches a new high point.at n=8A352919
• Expansion of (1/x) * Series_Reversion( x * (1+x^2/(1-x))^2 ).at n=15A369076
• E.g.f. satisfies A(x) = 1/(1 + A(x)^2 * log(1 - x))^2.at n=4A377411