cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A235933 Numbers coprime to 35.

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 9, 11, 12, 13, 16, 17, 18, 19, 22, 23, 24, 26, 27, 29, 31, 32, 33, 34, 36, 37, 38, 39, 41, 43, 44, 46, 47, 48, 51, 52, 53, 54, 57, 58, 59, 61, 62, 64, 66, 67, 68, 69, 71, 72, 73, 74, 76, 78, 79, 81, 82, 83, 86, 87, 88, 89, 92, 93, 94, 96, 97, 99
Offset: 1

Views

Author

Oleg P. Kirillov, Jan 17 2014

Keywords

Comments

The asymptotic density of this sequence is 24/35. - Amiram Eldar, Oct 23 2020

Crossrefs

Cf. A160547 (numbers coprime to 31), A229968 (numbers coprime to 33), A204458 (numbers coprime to 34), A007310 (numbers coprime to 36).
Cf. A045572 (numbers not divisible by 5 or 2), A229829 (numbers not divisible by 5 or 3), A047201 (numbers not divisible by 5), A236207 (numbers not divisible by 5 or 11).

Programs

  • Haskell
    a235933 n = a235933_list !! (n-1)
    a235933_list = filter ((== 1) . gcd 35) [1..]
    -- Reinhard Zumkeller, Mar 27 2014
  • Magma
    [n: n in [1..100] | GCD(n,35) eq 1]; // Bruno Berselli, Mar 27 2014
    
  • Mathematica
    Select[Range[100], GCD[#, 35] == 1 &] (* Bruno Berselli, Mar 27 2014 *)
  • Sage
    [i for i in range(100) if gcd(i, 35) == 1] # Bruno Berselli, Mar 27 2014
    

Extensions

Signature corrected from Georg Fischer, Feb 07 2021
Erroneous recurrence removed from Bruno Berselli, Feb 08 2021
Showing 1-1 of 1 results.