35955

Appears in sequences

• Least a(n) such that the period of continued fraction for sqrt(a(n)) has at least n successive 1's.at n=13A060215
• a(n) is the least m such that a period of the continued fraction expansion of sqrt(m) is 1,1,1,...,1,1,1,Z and there are n ones in the period (Z is 2*floor(sqrt(m))). If no such m exists, a(n) = 0.at n=12A071296
• Number of 2-Abelian equivalence classes of words of length n over an alphabet of size 3.at n=15A289658
• Solution of the complementary equation a(n) = a(n-1) + a(n-3) + a(n-4) + b(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4, b(0) = 5, b(1) = 6, b(2) = 7, b(3) = 8, and (a(n)) and (b(n)) are increasing complementary sequences.at n=20A295754
• a(n) is the least k such that the denominators of continued fraction convergents for sqrt(k) match the first n Fibonacci numbers.at n=13A309666
• Triangle read by rows giving the sum of the number of k-matchings of the graphs obtained by deleting one edge and its two vertices from the ladder graph L_n = P_2 X P_n in all possible ways.at n=40A318243