19711

Appears in sequences

• Number of terms in n-th derivative of a function composed with itself 3 times.at n=20A022811
• a(n) = A027113(n, 2n-4).at n=9A027122
• Smallest k>n such that n^3+1 divides k*n^2+1.at n=27A071568
• a(n) is the smallest number k such that A073813(k) = prime(n).at n=34A073814
• Start with 1 and repeatedly reverse the digits and add 65 to get the next term.at n=36A118163
• a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=34A120389
• a(n) = 3^n + 3*n + 1.at n=9A176805
• Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (1,1,1,1).at n=22A199926
• Meandric numbers for a river crossing up to 3 parallel roads at n points.at n=12A204352
• Number of (w,x,y) with all terms in {0,...,n} and |w-x| + |x-y| + |y-w| >= w + x + y.at n=40A213489
• Number of (n+1)X(6+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..6+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=2A233365
• T(n,k) is the number of (n+1) X (k+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=30A233366
• Number of (3+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{j*x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..3+1} nondecreasing.at n=5A233368
• a(n) = Sum_{k=0..n} p(k)*q(k), where p(k) = partition numbers (A000041) and q(k) = partition numbers into distinct parts (A000009).at n=16A265096
• Growth series for affine Coxeter group B_8.at n=9A267171
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 782", based on the 5-celled von Neumann neighborhood.at n=14A284027
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 161", based on the 5-celled von Neumann neighborhood.at n=15A286166
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 521", based on the 5-celled von Neumann neighborhood.at n=15A288898
• a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/k)^3.at n=27A344721
• a(n) = Sum_{k=1..n} binomial(floor(n/k)+2,3).at n=44A364970