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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154609 a(n) = 13*n + 5. 5
5, 18, 31, 44, 57, 70, 83, 96, 109, 122, 135, 148, 161, 174, 187, 200, 213, 226, 239, 252, 265, 278, 291, 304, 317, 330, 343, 356, 369, 382, 395, 408, 421, 434, 447, 460, 473, 486, 499, 512, 525, 538, 551, 564, 577, 590, 603, 616, 629, 642, 655, 668, 681, 694 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Any square mod 13 is one of 0, 1, 3, 4, 9, 10 or 12 (A010376) but not 5, for this reason there are no squares in sequence. - Bruno Berselli, Feb 19 2016

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (2,-1).

FORMULA

G.f.: (8*x+5)/(1-x)^2. - Vincenzo Librandi, Feb 26 2012

a(n) = 2*a(n-1)-a(n-2). - Vincenzo Librandi, Feb 26 2012

MATHEMATICA

Range[5, 1000, 13] (* Vladimir Joseph Stephan Orlovsky, May 31 2011 *)

CoefficientList[Series[(8 x + 5)/(1 - x)^2, {x, 0, 60}], x] (* Vincenzo Librandi, Feb 26 2012 *)

PROG

(PARI) a(n)=13*n+5 \\ Charles R Greathouse IV, Dec 28 2011

(Magma) I:=[5, 18]; [n le 2 select I[n] else 2*Self(n-1)-Self(n-2): n in [1..50]]; // Vincenzo Librandi, Feb 26 2012

CROSSREFS

Sequence in context: A140365 A063294 A063141 * A063125 A031004 A063120

Adjacent sequences: A154606 A154607 A154608 * A154610 A154611 A154612

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Jan 15 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 11:54 EST 2022. Contains 358521 sequences. (Running on oeis4.)