22268

Appears in sequences

• a(n) = a(n-1) + a(n-8), with a(i) = 1 for i = 0..7.at n=52A005710
• Number of lines through exactly 3 points of an n X n grid of points.at n=30A018810
• Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DDR = Deca-dodecasil 3R[Si120O240]qR starting with a T4 atom.at n=13A019107
• a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=7.at n=18A022312
• a(n) = floor( e * 2^n ).at n=13A027437
• a(1) = 2; for n>1, a(n) = smallest integer > a(n-1) such that a(n) + a(i) + 1 is prime for all 1 <= i <= n-1.at n=7A093483
• Number of nX5 arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2.at n=2A221252
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2.at n=23A221255
• Number of 3Xn arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2.at n=4A221257
• The integer k that minimizes |k/2^n - e|.at n=13A293338
• Number of n X 5 0..1 arrays with every element unequal to 0, 1, 4 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=8A318542
• Number of maximal Golomb rulers of length n.at n=41A325683
• G.f. A(x) satisfies A(x) = 1 / (1 - x * A(x^8)).at n=53A367800
• a(n) = Sum_{k=0..floor(n/4)} binomial(2*n-7*k,k).at n=26A373644
• Numbers k such that k - sopfr(k) is a positive cube.at n=21A389889