59185

Appears in sequences

• a(n) is square mod a(i), i < n; a(n) nonsquare; a(1) = 2.at n=22A034901
• a(0)=1, a(1)=1, a(n) = 9*a(n/2) for even n >= 2, and a(n) = 8*a((n-1)/2) + a((n+1)/2) for odd n >= 3.at n=35A116526
• Constant term in the reduction by (x^2 -> x + 1) of the polynomial C(n)*x^n, where C=A000285.at n=12A192914
• Fill an array by antidiagonals upwards; in the top left cell enter a(0)=1; thereafter, in the n-th cell, enter the sum of the entries of those earlier cells that can be seen from that cell.at n=48A279212
• G.f.: F(F(F(x))) where F(x) = x/(1-x-x^2) is the g.f. for the Fibonacci numbers.at n=9A283679