38613965

Appears in sequences

• Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).at n=21A000129
• Numbers k such that 2*k^2 - 1 is a square.at n=10A001653
• Denominators of continued fraction convergents to sqrt(8).at n=20A041011
• a(n) is the least natural number m such that the fractional part of m*(2^0.5) is less than 2^(-n).at n=24A058580
• a(n) is the least natural number m such that the fractional part of m*(2^0.5) is less than 2^(-n).at n=25A058580
• Number of 2 X n binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=18A069306
• Expansion of 1/(1 + 2*x - x^2).at n=20A077985
• a(0) = a(1) = 1; thereafter a(2*n+1) = 2*a(2*n) - a(2*n-1), a(2*n) = 4*a(2*n-1) - a(2*n-2).at n=21A079496
• Greedy frac multiples of sqrt(2): a(1)=1, Sum_{n>=0} frac(a(n)*x)=1 at x=sqrt(2).at n=29A079934
• a(0)=0; a(1)=1; a(2n) = 4*Sum_{k=0..n} a(2k-1); a(2n+1) = a(2n) + a(2n-1).at n=21A089499
• Interlaces "2*n^2 - 1 is a square" with NSW numbers.at n=20A104683
• Pythagorean triples of nearly isosceles triangle.at n=29A114336
• a(n) = 6*a(n-4) - a(n-8).at n=39A116558
• a(n) = 6*a(n-4) - a(n-8).at n=41A116558
• a(2n) = A001653(n) (Numbers n such that 2*n^2 - 1 is a square), a(2n+1) = A038725(n+1).at n=20A117719
• a(2n) = A100525(n), a(2n+1) = A001653(n+1); a Pellian-related sequence.at n=19A129346
• Repeat Pell numbers A000129.at n=42A135153
• A trisection of A000129, the Pell numbers.at n=7A142588
• a(n) = Product_{k=1..floor((n-1)/2)} (4 + 4*cos(k*Pi/n)^2).at n=21A152118
• Denominators in the approximation of sqrt(2) satisfying the recurrence: a(n)= [a(n-1)*a(n-2)+2]/[a(n-1)+a(n-2)] with a(1)=a(2)=1.at n=7A179823