|
| |
| |
|
|
|
3, 8, 13, 18, 23, 28, 33, 38, 43, 48, 53, 58, 63, 68, 73, 78, 83, 88, 93, 98, 103, 108, 113, 118, 123, 128, 133, 138, 143, 148, 153, 158, 163, 168, 173, 178, 183, 188, 193, 198, 203, 208, 213, 218, 223, 228, 233, 238, 243, 248, 253, 258, 263, 268, 273, 278, 283
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Numbers ending in 3 or 8. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 08 2006
a(n) is the set of numbers congruent to {3,8,13} mod 15 [From Gary Detlefs (gdetlefs(AT)aol.com), Mar 07 2010]
|
|
|
REFERENCES
| L. Hogben, Choice and Chance by Cardpack and Chessboard. Vol. 1, Chanticleer Press, NY, 1950, p. 36.
|
|
|
LINKS
| Tanya Khovanova, Recursive Sequences
|
|
|
FORMULA
| a(n) = floor((15n-5)/3) with offset 1..a(1)=3 [From Gary Detlefs (gdetlefs(AT)aol.com), Mar 07 2010]
a(n)=10*n-a(n-1)+1 (with a(0)=3) [From Vincenzo Librandi, Nov 20 2010]
G.f.: (3+2*x)/(1-x)^2. [Colin Barker, Jan 08 2012]
|
|
|
MAPLE
| a[1]:=3:for n from 2 to 100 do a[n]:=a[n-1]+5 od: seq(a[n], n=1..57); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008
|
|
|
MATHEMATICA
| Range[3, 500, 5] (* From Vladimir Joseph Stephan Orlovsky (4vladimir(AT)gmail.com), May 26 2011 *)
|
|
|
PROG
| (Other) sage: [i+3 for i in range(285) if gcd(i, 5) == 5] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
|
|
|
CROSSREFS
| Cf. A008587, A016861, A016873.
Sequence in context: A190505 A184921 A095762 * A190517 A105502 A105702
Adjacent sequences: A016882 A016883 A016884 * A016886 A016887 A016888
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jul 06 2000
|
| |
|
|
