170624

Appears in sequences

• Number of strict first-order maximal independent sets in path graph.at n=42A007383
• Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(3,6).at n=19A018918
• Pisot sequences E(6,8), P(6,8).at n=36A020716
• Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=42A023434
• Expansion of 1/((1-2*x+x^2-x^3)*(1-x)).at n=20A077855
• Number of compositions of n into parts 2 and 3 with at least one 2 and one 3.at n=46A245332
• a(n) is the least number k such that A048105(k) = A048105(k+1) = 2*n, and 0 if it does not exist.at n=12A344315
• Numbers k such that k and k+1 are both nonexponential abundant numbers.at n=2A348606
• Numbers k such that k and k+1 are both in A357605.at n=4A357608
• Numbers k such that each of k and k+1 is either a practical number (A005153) or an almost practical number (A174533).at n=31A387654