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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A016873 5n+2. 18
2, 7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197, 202, 207, 212, 217, 222, 227, 232, 237, 242, 247, 252, 257, 262, 267, 272, 277 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Also solutions to 3^x + 5^x == 1 mod 11. - Cino Hilliard (hillcino368(AT)gmail.com), May 18 2003

Numbers ending in 2 or 7. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 08 2006

LINKS

Tanya Khovanova, Recursive Sequences

Cino Hilliard, Title?

FORMULA

a(n)=10*n-a(n-1)-1 (with a(0)=2) [From Vincenzo Librandi, Nov 20 2010]

G.f.: (2+3*x)/(1-x)^2. [Colin Barker, Jan 08 2012]

MAPLE

a[1]:=2:for n from 2 to 100 do a[n]:=a[n-1]+5 od: seq(a[n], n=1..47); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008

MATHEMATICA

Range[2, 500, 5] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 26 2011 *)

PROG

(Other) sage: [i+2 for i in range(235) if gcd(i, 5) == 5] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]

CROSSREFS

Cf. A008586, A008587, A016861.

Sequence in context: A160455 A045929 A105501 * A019592 A131190 A099353

Adjacent sequences:  A016870 A016871 A016872 * A016874 A016875 A016876

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 13 19:49 EST 2012. Contains 205536 sequences.