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-2 of 2 results.

A229829 Numbers coprime to 15.

Original entry on oeis.org

1, 2, 4, 7, 8, 11, 13, 14, 16, 17, 19, 22, 23, 26, 28, 29, 31, 32, 34, 37, 38, 41, 43, 44, 46, 47, 49, 52, 53, 56, 58, 59, 61, 62, 64, 67, 68, 71, 73, 74, 76, 77, 79, 82, 83, 86, 88, 89, 91, 92, 94, 97, 98, 101, 103, 104, 106, 107, 109, 112, 113, 116, 118, 119
Offset: 1

Views

Author

Gary Detlefs, Oct 01 2013

Keywords

Comments

A001651 INTERSECT A047201.
a(n) - 15*floor((n-1)/8) - 2*((n-1) mod 8) has period 8, repeating [1,0,0,1,0,1,1,0].
Numbers whose odd part is 7-rough: products of terms of A007775 and powers of 2 (terms of A000079). - Peter Munn, Aug 04 2020
The asymptotic density of this sequence is 8/15. - Amiram Eldar, Oct 18 2020

Crossrefs

Lists of numbers coprime to other semiprimes: A007310 (6), A045572 (10), A162699 (14), A160545 (21), A235933 (35).
Subsequence of: A001651, A047201.
Subsequences: A000079, A007775.

Programs

  • Magma
    [n: n in [1..120] | IsOne(GCD(n,15))]; // Bruno Berselli, Oct 01 2013
    
  • Maple
    for n from 1 to 500 do if n mod 3<>0 and n mod 5<>0 then print(n) fi od
  • Mathematica
    Select[Range[120], GCD[#, 15] == 1 &] (* or *) t = 70; CoefficientList[Series[(1 + x + 2 x^2 + 3 x^3 + x^4 + 3 x^5 + 2 x^6 + x^7 + x^8)/((1 - x)^2 (1 + x) (1 + x^2) (1 + x^4)) , {x, 0, t}], x] (* Bruno Berselli, Oct 01 2013 *)
    Select[Range[120],CoprimeQ[#,15]&] (* Harvey P. Dale, Oct 31 2013 *)
  • Sage
    [i for i in range(120) if gcd(i, 15) == 1] # Bruno Berselli, Oct 01 2013

Formula

a(n+8) = a(n) + 15.
a(n) = 15*floor((n-1)/8) +2*f(n) +floor(2*phi*(f(n+1)+2)) -2*floor(phi*(f(n+1)+2)), where f(n) = (n-1) mod 8 and phi=(1+sqrt(5))/2.
a(n) = 15*floor((n-1)/8) +2*f(n) +floor((2*f(n)+5)/5) -floor((f(n)+2)/3), where f(n) = (n-1) mod 8.
From Bruno Berselli, Oct 01 2013: (Start)
G.f.: x*(1 +x +2*x^2 +3*x^3 +x^4 +3*x^5 +2*x^6 +x^7 +x^8) / ((1-x)^2*(1+x)*(1+x^2)*(1+x^4)). -
a(n) = a(n-1) +a(n-8) -a(n-9) for n>9. (End)
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*sqrt(7 + sqrt(5) - sqrt(6*(5 + sqrt(5))))*Pi/15. - Amiram Eldar, Dec 13 2021

A321483 a(n) = 7*2^n + (-1)^n.

Original entry on oeis.org

8, 13, 29, 55, 113, 223, 449, 895, 1793, 3583, 7169, 14335, 28673, 57343, 114689, 229375, 458753, 917503, 1835009, 3670015, 7340033, 14680063, 29360129, 58720255, 117440513, 234881023, 469762049, 939524095, 1879048193, 3758096383, 7516192769, 15032385535
Offset: 0

Views

Author

Paul Curtz, Nov 11 2018

Keywords

Comments

Difference table:
8, 13, 29, 55, 113, 223, 449, ...
5, 16, 26, 58, 110, 226, 446, 898, ...
11, 10, 32, 52, 116, 220, 452, 892, 1796, ...
-1, 22, 20, 64, 104, 232, 440, 904, 1784, 3592, ...
-2, 44, 40, 128, 208, 464, 880, 1808, 3568, 7184, ...
etc.
Every diagonal is a sequence of the form k*2^m.
a(n) is divisible by
. 5 if n is a term of A004767,
. 11 if n is a term of A016885,
. 13 if n is a term of A017533.

Crossrefs

Programs

  • Mathematica
    a[n_] := 7*2^n + (-1)^n ; Array[a, 32, 0] (* Amiram Eldar, Nov 12 2018 *)
    CoefficientList[Series[E^-x + 7 E^(2 x), {x, 0, 20}], x]*Table[n!, {n, 0, 20}] (* Stefano Spezia, Nov 12 2018 *)
    LinearRecurrence[{1,2},{8,13},40] (* Harvey P. Dale, Mar 18 2022 *)
  • PARI
    Vec((8 + 5*x) / ((1 + x)*(1 - 2*x)) + O(x^40)) \\ Colin Barker, Nov 11 2018

Formula

O.g.f.: (8 + 5*x) / ((1 + x)*(1 - 2*x)). - Colin Barker, Nov 11 2018
E.g.f.: exp(-x) + 7*exp(2*x). - Stefano Spezia, Nov 12 2018
a(n) = a(n-1) + 2*a(n-2).
a(n) = 2*a(n-1) + 3*(-1)^n for n>0, a(0)=8.
a(2*k) = 7*4^k + 1, a(2*k+1) = 14*4^k - 1.
a(n) = A014551(n) + A014551(n-1) + A014551(n-2).
a(n) = 2^(n+3) - 3*A001045(n).
a(n) mod 9 = A070366(n+3).
a(n) + a(n+1) = 21*2^n.

Extensions

Two terms corrected, and more terms added by Colin Barker, Nov 11 2018
Showing 1-2 of 2 results.