The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096019 a(0)=3, a(n) = 3*a(n-1) + 2*(-1)^n. 1
 3, 7, 23, 67, 203, 607, 1823, 5467, 16403, 49207, 147623, 442867, 1328603, 3985807, 11957423, 35872267, 107616803, 322850407, 968551223, 2905653667, 8716961003, 26150883007, 78452649023, 235357947067, 706073841203, 2118221523607 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The number of Pythagorean quadruples mod 3^n is given by a(n) 3^(2n-1). See A096018. LINKS Index entries for linear recurrences with constant coefficients, signature (2, 3). FORMULA a(n) = 3^(n+1)-(3^n-(-1)^n)/2. a(n) = 2*a(n-1)+3*a(n-2). G.f.: (3+x)/((1+x)*(1-3*x)). [Colin Barker, Mar 26 2012] CROSSREFS Sequence in context: A148692 A201204 A106964 * A148693 A148694 A148695 Adjacent sequences:  A096016 A096017 A096018 * A096020 A096021 A096022 KEYWORD nonn,easy AUTHOR T. D. Noe, Jun 15 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 22:20 EDT 2021. Contains 346265 sequences. (Running on oeis4.)