31571

Appears in sequences

• Number of strict first-order maximal independent sets in path graph.at n=36A007383
• 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=16A018918
• Pisot sequences E(6,8), P(6,8).at n=30A020716
• Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-4).at n=36A023434
• a(n) = S(n)*S(n-1), where S(n) are the generalized tribonacci numbers A001644.at n=9A073748
• Expansion of 1/((1-2*x+x^2-x^3)*(1-x)).at n=17A077855
• Brilliant numbers k such that 2k+1 is also brilliant.at n=17A085649
• Indices of primes in sequence defined by A(0) = 37, A(n) = 10*A(n-1) - 63 for n > 0.at n=15A101824
• Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones.at n=43A102425
• a(n) = denominator of b(n), where b(1) = 1, b(n+1) = (sum{k=1 to n} b(k))/product{j=1 to n} b(j).at n=12A127679
• Totally multiplicative sequence with a(p) = a(p-1) + 10 for prime p.at n=34A166707
• Partial sums of A012814.at n=8A176476
• Number of compositions of n into parts 2 and 3 with at least one 2 and one 3.at n=40A245332