195025

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=15A000129
• Numbers k such that 2*k^2 - 1 is a square.at n=7A001653
• Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z.at n=32A002559
• Interleave denominators (A000129) and numerators (A001333) of convergents to sqrt(2).at n=30A002965
• Denominators of continued fraction convergents to sqrt(8).at n=14A041011
• Essentially a duplicate of A000129.at n=13A048624
• 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=17A058580
• 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=18A058580
• The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to sqrt(2).at n=43A065375
• Number of n X 14 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=0A069305
• 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=12A069306
• a(n) is the n-th new record value in A073300.at n=39A073301
• Expansion of 1/(1 + 2*x - x^2).at n=14A077985
• 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=15A079496
• Greedy frac multiples of sqrt(2): a(1)=1, Sum_{n>=0} frac(a(n)*x)=1 at x=sqrt(2).at n=20A079934
• 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=15A089499
• Expansion of -x*(1+x+x^2+x^4)/(-1+2*x^3+x^6).at n=42A092550
• Expansion of -x*(1+x+x^2+x^4)/(-1+2*x^3+x^6).at n=44A092550
• a(n) = n*(n^3 - n + 2)/2.at n=25A101374
• Interlaces "2*n^2 - 1 is a square" with NSW numbers.at n=14A104683