19115

Appears in sequences

• Positions of remoteness 3 in Beans-Don't-Talk.at n=40A005695
• Numbers whose base-2 representation has exactly 13 runs.at n=20A043580
• a(n) = 2*a(n-1) - (-1)^n for n > 0, a(0)=2.at n=13A062092
• Trajectory of n under the Reverse and Add! operation carried out in base 3 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.at n=38A077405
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,3}.at n=46A079957
• A007318^(-1) * A133648.at n=13A133649
• Number of (1,0)-steps at levels 0,2,4,... in all peakless Motzkin paths of length n.at n=13A190166
• Dispersion of A004767 (4k+3, k>=0), by antidiagonals.at n=48A191669
• a(n) = (14*4^n + 1)/3.at n=6A206373
• Number of Gram blocks [g(j), g(j+4)) up to 10^n with 0 <= j < 10^n.at n=3A231160
• Number of distinct terms at a given iteration of the Collatz (or 3x+1) map starting with 0.at n=15A275544
• 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 366", based on the 5-celled von Neumann neighborhood.at n=16A281421
• Expansion of (2 + 6*x + 3*x^2 +4*x^3 - 10*x^4)/(1 - x - 4*x^4 + 4*x^5).at n=26A309792
• Expansion of Product_{i>=2, j>=2} (1 + x^(i*j))^j.at n=37A326831
• a(n) is the number of primes q less than primorial(n) having k = 2 as the least exponent such that q^k == 1 (mod primorial(n)).at n=17A336016
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x^2.at n=49A367208