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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A017437 a(n) = 11*n + 4. 6
4, 15, 26, 37, 48, 59, 70, 81, 92, 103, 114, 125, 136, 147, 158, 169, 180, 191, 202, 213, 224, 235, 246, 257, 268, 279, 290, 301, 312, 323, 334, 345, 356, 367, 378, 389, 400, 411, 422, 433, 444, 455, 466, 477, 488, 499, 510, 521, 532, 543, 554, 565, 576, 587 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

These numbers do not occur in A000045 (Fibonacci numbers). - Arkadiusz Wesolowski, Jan 08 2012

LINKS

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

Tanya Khovanova, Recursive Sequences

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

FORMULA

a(0)=4, a(1)=15, a(n) = 2*a(n-1) - a(n-2). - Harvey P. Dale, May 19 2012

MATHEMATICA

Range[4, 1000, 11] (* Vladimir Joseph Stephan Orlovsky, May 28 2011 *)

LinearRecurrence[{2, -1}, {4, 15}, 60] (* Harvey P. Dale, May 19 2012 *)

PROG

(Sage) [i+4 for i in range(475) if gcd(i, 11) == 11] # Zerinvary Lajos, May 21 2009

(MAGMA)[11*n+4: n in [0..60]]; // Vincenzo Librandi, Sep 18 2011

(PARI) a(n)=11*n+4 \\ Charles R Greathouse IV, Oct 07 2015

CROSSREFS

Cf. A008593, A017425.

Sequence in context: A171788 A063129 A061873 * A281264 A267103 A030553

Adjacent sequences:  A017434 A017435 A017436 * A017438 A017439 A017440

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 28 12:53 EDT 2017. Contains 289889 sequences.