80782

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=14A000129
• a(n) = 6*a(n-1) - a(n-2) for n > 1, a(0)=0 and a(1)=2.at n=7A001542
• Interleave denominators (A000129) and numerators (A001333) of convergents to sqrt(2).at n=28A002965
• Essentially a duplicate of A000129.at n=12A048624
• The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to sqrt(2).at n=39A065375
• Number of n X 13 binary arrays with a path of adjacent 1's from upper left corner to anywhere in right hand column.at n=0A069304
• 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=11A069306
• a(n) is the n-th new record value in A073300.at n=36A073301
• a(1) = 1, a(2) = 2; a(2*k) = 2*a(2*k-1) - a(2*k-2), a(2*k+1) = 4*a(2*k) - a(2*k-1).at n=13A084068
• Expansion of -x*(1+x+x^2+x^4)/(-1+2*x^3+x^6).at n=39A092550
• Expansion of -x*(1+x+x^2+x^4)/(-1+2*x^3+x^6).at n=41A092550
• Expansion of (3 -4*x -3*x^2)/((1-x^2)*(1-2*x-x^2)); a Pellian-related sequence.at n=13A114647
• a(n) = 6*a(n-4) - a(n-8).at n=28A116558
• Numbers k such that 2*k^2+1 is a perfect power.at n=8A117547
• Dispersion of the sequence ([r*n] + 1: n >= 1), where r = 3 + 8^(1/2): square array D(n,m) (n, m >= 1), read by ascending antidiagonals.at n=34A120859
• Fixed-k dispersion for Q = 8: Square array D(g,h) (g, h >= 1), read by ascending antidiagonals.at n=34A120861
• a(n) = 6*a(n-2) - a(n-4) for n > 4, with a(1)=1, a(2)=0, a(3)=3, a(4)=2.at n=15A126354
• Triangle read by rows: T(n,k) is the number of binary trees with n edges and k jumps (n >= 0, 0 <= k <= max(0,ceiling(n/2)-1) ).at n=43A127530
• a(2n) = A001542(n+1), a(2n+1) = A038761(n+1); a Pellian-related sequence.at n=12A129345
• Repeat Pell numbers A000129.at n=28A135153