19072

Appears in sequences

• Number of unrooted triangulations with reflection symmetry of a hexagon with n internal nodes.at n=8A005507
• Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 69.at n=30A031567
• Expansion of (1-3x)/(1-x^2+x^3).at n=34A117374
• Number of subsets of {1,2,...,n} which contain no three consecutive odd numbers.at n=14A127195
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 1, 0), (1, 1, 1)}.at n=7A151026
• Maxima in A163169.at n=41A163172
• Number of binary strings of length n with no substrings equal to 0000 0001 or 0100.at n=13A164409
• Products of the 7th power of a prime and a distinct prime (p^7*q).at n=36A179664
• Consider the partitions of n in reverse lexicographic ordering (A080577), a(n) is the position of the partition of n which has the maximum LCM. See A000793.at n=41A213952
• Number of self-avoiding walks of any length from NW to SW corners of a grid or lattice with 4 rows and n columns.at n=6A214931
• a(n) = A255473(2^n-1).at n=7A255474
• Array read by antidiagonals: T(n,m) = number of self-avoiding walks of any length from NW to SW corners on a grid with n rows and m columns.at n=48A271465
• 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 662", based on the 5-celled von Neumann neighborhood.at n=14A286780
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) + 1, where a(0) = 1, a(1) = 2, b(0) = 3.at n=17A294533
• Primitive practical numbers of the form 2^i * prime(k).at n=33A308710
• a(1) = 24603, a(n) = n*a(n-1) but products that are not in A010784 are first reduced as in A320486 (see comments); continue until zero is reached.at n=3A321148
• Number of inversion sequences of length n where all consecutive subsequences i,j,k satisfy i > j <= k or i <= j > k.at n=10A328491
• a(n) is the smallest abundant number of the form 2^e * prime(n).at n=33A341361
• Expansion of Product_{k>=1} (1 + 2^(k+1)*x^k) * (1 + 2^(k-1)*x^k).at n=8A370761
• a(n) = A376877(n) / p where p is the largest prime factor of A376877(n).at n=36A376874