302632

Appears in sequences

• a(2n+1) = a(2n) + a(2n-1), a(2n) = 2*a(2n-1) + a(2n-2); a(n) = n for n = 0, 1.at n=20A048788
• a(n) = 4*a(n-1) - a(n-2), with a(0) = 0, a(1) = 2.at n=10A052530
• a(n) = 14*a(n-1) - a(n-2); a(0) = 0, a(1) = 8.at n=5A067900
• Limit of the sequence obtained from S(0) = (1,1) and, for n > 0, S(n) = I(S(n-1)), where I consists of inserting, for i = 1, 2, 3..., the term a(i) + a(i+1) between any two terms for which 7*a(i+1) <= 11*a(i).at n=19A082630
• Expansion of (1-2x-3x^2+x^3-x^5)/(1+4x^3+x^6).at n=28A157126
• The pairs (x,y) such that (x^2 + y^2)/(x*y + 1) is a perfect square, i.e., 4.at n=19A162959
• The pairs (x,y) such that (x^2 + y^2)/(x*y + 1) is a perfect square, i.e., 4.at n=20A162959
• Number of binary strings of length n with equal numbers of 00001 and 01000 substrings.at n=19A164197
• a(n) = a(n-1) + (if a(n-1) is odd a(n-2) else a(n-3)) with a(0) = 0, a(1) = 1.at n=30A254308
• Maximal term of TRIP-Stern sequence of level n corresponding to permutation triple (e,23,e).at n=37A271488