login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157336 64n + 8. 2
72, 136, 200, 264, 328, 392, 456, 520, 584, 648, 712, 776, 840, 904, 968, 1032, 1096, 1160, 1224, 1288, 1352, 1416, 1480, 1544, 1608, 1672, 1736, 1800, 1864, 1928, 1992, 2056, 2120, 2184, 2248, 2312, 2376, 2440, 2504, 2568, 2632, 2696, 2760, 2824, 2888, 2952 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

The identity (128*n^2+32*n+1)^2-(4*n^2+n)*(64*n+8)^2=1 can be written as A157337(n)^2-A007742(n)*a(n)^2=1. This is the case s=2 of the identity (8*n^2*s^4+8*n*s^2+1)^2-(n^2*s^2+n)*(8*n*s^3+4*s)^2=1. - Vincenzo Librandi, Jan 29 2012

Likewise, the immediate identity (a(n)^2+1)^2-(a(n)^2+2)*a(n)^2 = 1 can be rewritten as A158686(8n+1)^2-(A158686(8n+1)+1)*a(n)^2=1. - Bruno Berselli, Feb 13 2012

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..10000

Index to sequences with linear recurrences with constant coefficients, signature (2,-1).

FORMULA

G.f.: x*(8*x+72)/(x-1)^2. - Vincenzo Librandi, Jan 29 2012

a(n) = 2*a(n-1)-a(n-2). - Vincenzo Librandi, Jan 29 2012

MATHEMATICA

Range[72, 5000, 64] (* From Vladimir Joseph Stephan Orlovsky, Jul 16 2011 *)

LinearRecurrence[{2, -1}, {72, 136}, 50] (* Vincenzo Librandi, Jan 29 2012 *)

PROG

(MAGMA) I:=[72, 136]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // Vincenzo Librandi, Jan 29 2012

(PARI) for(n=1, 40, print1(64*n + 8", ")); \\ Vincenzo Librandi, Jan 29 2012

CROSSREFS

Cf. A007742, A157337.

Sequence in context: A078667 A090784 A143741 * A060661 A050495 A137883

Adjacent sequences:  A157333 A157334 A157335 * A157337 A157338 A157339

KEYWORD

nonn,easy,changed

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 27 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.