|
Search: id:A016885
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
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)=10*n-a(n-1)-9 (with a(1)=3) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 26 2009]
a(n) = floor((15n-5)/3) with offset 1..a(1)=3 [From Gary Detlefs (gdetlefs(AT)aol.com), Mar 07 2010]
|
|
EXAMPLE
|
For n=2, a(2)=10*2-3-9=8; n=3, a(3)=10*3-8-9=13; n=4, a(4)=10*4-13-9=18 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 26 2009]
|
|
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
|
f[n_]:=5*n+3; lst={}; Do[a=f[n]; AppendTo[lst, a], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 25 2009]
|
|
PROGRAM
|
(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
|
Sequence in context: A010064 A133330 A095762 this_sequence A105502 A105702 A081989
Adjacent sequences: A016882 A016883 A016884 this_sequence A016886 A016887 A016888
|
|
KEYWORD
|
nonn,easy,new
|
|
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
|
|
|
Search completed in 0.002 seconds
|
