The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A159007 Numbers k such that k == 32 or 41 (mod 73). 6
 32, 41, 105, 114, 178, 187, 251, 260, 324, 333, 397, 406, 470, 479, 543, 552, 616, 625, 689, 698, 762, 771, 835, 844, 908, 917, 981, 990, 1054, 1063, 1127, 1136, 1200, 1209, 1273, 1282, 1346, 1355, 1419, 1428, 1492, 1501, 1565, 1574, 1638, 1647, 1711, 1720 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Also, numbers k such that k^2 == 2 (mod 73). LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 Index entries for linear recurrences with constant coefficients, signature (1,1,-1). FORMULA a(n) = a(n-1) + a(n-2) - a(n-3) with a(1)=32, a(2)=41, a(3)=105. a(n) = (73 + 55*(-1)^(n-1) + 146*(n-1))/4. G.f.: x*(32 + 9*x + 32*x^2)/((1+x)*(x-1)^2). - R. J. Mathar, Jul 18 2009 MATHEMATICA LinearRecurrence[{1, 1, -1}, {32, 41, 105}, 60] (* Harvey P. Dale, Aug 09 2016 *) PROG (Magma) I:=[32, 41, 105]; [n le 3 select I[n] else Self(n-1)+Self(n-2)-Self(n-3): n in [1..60]]; // Vincenzo Librandi, Mar 02 2012 (PARI) for(n=1, 50, print1((73+55*(-1)^(n-1)+146*(n-1))/4", ")); \\ Vincenzo Librandi, Mar 02 2012 CROSSREFS Sequence in context: A363530 A240246 A167309 * A114042 A302168 A104390 Adjacent sequences: A159004 A159005 A159006 * A159008 A159009 A159010 KEYWORD nonn,easy AUTHOR Vincenzo Librandi, Jun 30 2009 EXTENSIONS Sign of k in the definition clarified by R. J. Mathar, Jul 18 2009 New name from Charles R Greathouse IV, Jan 11 2012 STATUS approved

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

Last modified August 3 23:57 EDT 2024. Contains 374905 sequences. (Running on oeis4.)