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

 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!)
 A230215 Numbers divisible by 3 or 13. 1
 3, 6, 9, 12, 13, 15, 18, 21, 24, 26, 27, 30, 33, 36, 39, 42, 45, 48, 51, 52, 54, 57, 60, 63, 65, 66, 69, 72, 75, 78, 81, 84, 87, 90, 91, 93, 96, 99, 102, 104, 105, 108, 111, 114, 117, 120, 123, 126, 129, 130, 132, 135, 138, 141, 143, 144, 147, 150, 153, 156 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In general, sequences of numbers divisible by primes p and q will have the form a(n+p+q-1) = a(n) + p*q. Union of A008585 and A008595 (0 excluded). - Michel Marcus, Oct 16 2013 The asymptotic density of this sequence is 5/13. - Amiram Eldar, Mar 25 2021 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-1). FORMULA a(n+15) = a(n) + 39. MAPLE for n from 1 to 138 do if n mod 3 = 0 or n mod 13= 0 then print(n) fi od MATHEMATICA Select[Range[200], GCD[#, 39] > 1 &] (* T. D. Noe, Oct 15 2013 *) With[{nn=60}, Join[3*Range[nn], 13*Floor[3/13 Range[nn]]]]//Union//Rest (* Harvey P. Dale, May 25 2020 *) PROG (PARI) is(n)=gcd(n, 39)>1 \\ Charles R Greathouse IV, Dec 11 2013 CROSSREFS Complement of A229973. Cf. A008585, A008595. Sequence in context: A336341 A257220 A092452 * A120688 A102014 A337091 Adjacent sequences: A230212 A230213 A230214 * A230216 A230217 A230218 KEYWORD nonn,easy AUTHOR Gary Detlefs, Oct 11 2013 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.

Last modified December 5 21:40 EST 2022. Contains 358594 sequences. (Running on oeis4.)