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

A124309 5-almost primes indexed by primes.

Original entry on oeis.org

48, 72, 108, 120, 180, 208, 270, 280, 368, 420, 450, 520, 592, 612, 660, 700, 760, 828, 920, 952, 976, 1032, 1064, 1128, 1242, 1288, 1323, 1372, 1380, 1428, 1575, 1624, 1674, 1700, 1752, 1768, 1880, 1976, 2028, 2096, 2178, 2196, 2312, 2328, 2384, 2394, 2475
Offset: 1

Views

Author

Jonathan Vos Post, Oct 25 2006

Keywords

Examples

			a(1) = 5almostprime(prime(1)) = 5almostprime(2) = 48 = 2^4 * 3.
a(2) = 5almostprime(prime(2)) = 5almostprime(3) = 72 = 2^3 * 3^2.
a(3) = 5almostprime(prime(3)) = 5almostprime(5) = 108 = 2^2 * 3^3.
		

Crossrefs

Cf. A124308 Primes indexed by 5-almost primes. A124310 prime(5almostprime(n)) - 5almostprime(prime(n)). 4-almost primes indexed by primes = A124283. prime(4almostprime(n)) - 4almostprime(prime(n)) = A124284. Primes indexed by 3-almost primes = A124268. 3-almost primes indexed by primes = A124269. prime(3almostprime(n)) - 3almostprime(prime(n)) = A124270. See also A106349 Primes indexed by semiprimes. See also A106350 Semiprimes indexed by primes. See also A122824 Prime(semiprime(n)) - semiprime(prime(n)). Commutator [A000040, A001358] at n.

Programs

  • PARI
    list(lim)=my(v=List(),u=v); forprime(p=2,lim\16, forprime(q=2,min(lim\(8*p),p), forprime(r=2,min(lim\(4*p*q),q), forprime(s=2,min(lim\(2*p*q*r),r), forprime(t=2,min(lim\(p*q*r*s),s), listput(v,p*q*r*s*t)))))); v=Set(v); forprime(p=2,#v, listput(u,v[p])); v=0; Vec(u) \\ Charles R Greathouse IV, Feb 10 2017

Formula

a(n) = 5almostprime(prime(n)) = A014614(A000040(n)).

Extensions

a(16)-a(47) from Giovanni Resta, Jun 13 2016

A124308 Primes indexed by 5-almost primes.

Original entry on oeis.org

131, 223, 359, 409, 593, 613, 659, 953, 997, 1049, 1069, 1223, 1283, 1543, 1601, 1693, 1733, 1747, 1811, 1987, 2003, 2069, 2503, 2593, 2693, 2713, 2789, 2801, 2903, 3079, 3181, 3221, 3301, 3323, 3541, 3571, 3727, 4003, 4127, 4283
Offset: 1

Views

Author

Jonathan Vos Post, Oct 25 2006

Keywords

Examples

			a(1) = prime(5almostprime(1)) = prime(32 = 2^5) = 131.
a(2) = prime(5almostprime(2)) = prime(48 = 2^4 * 3) = 223.
a(3) = prime(5almostprime(3)) = prime(72 = 2^3 * 3^2) = 359.
a(4) = prime(5almostprime(4)) = prime(80 = 2^4 * 5) = 409.
		

Crossrefs

Cf. A124309 5-almost primes indexed by primes. A124310 prime(5almostprime(n)) - 5almostprime(prime(n)). 4-almost primes indexed by primes = A124283. prime(4almostprime(n)) - 4almostprime(prime(n)) = A124284. Primes indexed by 3-almost primes = A124268. 3-almost primes indexed by primes = A124269. prime(3almostprime(n)) - 3almostprime(prime(n)) = A124270. See also A106349 Primes indexed by semiprimes. See also A106350 Semiprimes indexed by primes. See also A122824 Prime(semiprime(n)) - semiprime(prime(n)). Commutator [A000040, A001358] at n.

Programs

  • Mathematica
    Prime[#]&/@Select[Range[600],PrimeOmega[#]==5&] (* Harvey P. Dale, Nov 20 2015 *)

Formula

a(n) = prime(5almostprime(n)) = A000040(A014614(n)). {p such that p is prime and omega(primepi(p)) = 5} = {p such that p is in A000040 and A001222(A000720(p)) = 5}.

A114415 Records in 5-almost prime gaps ordered by merit.

Original entry on oeis.org

16, 24, 28, 42, 56, 70
Offset: 1

Views

Author

Jonathan Vos Post, Nov 25 2005

Keywords

Comments

Next term, if it exists, is associated with indices above 100000 in A114405 and A014614. - R. J. Mathar, May 10 2007

Examples

			Records defined in terms of A114405 and A014614:
  n  A114405(n)  A114405(n)/log_10(A014614(n))
  =  ==========  =============================
  1      16      16/log_10(32)  = 10.6301699
  2      24      24/log_10(48)  = 14.2751673
  3      8       8/log_10(72)   = 4.30725248
  4      28      28/log_10(80)  = 14.7129144
  5      4       4/log_10(108)  = 1.96712564
  6      8       8/log_10(112)  = 3.90392819
  7      42      42/log_10(120) = 20.2002592
  8      6       6/log_10(168)  = 2.69625443
  ...
  22     56      56/log_10(312) = 22.4524976
		

Crossrefs

Programs

  • Maple
    A014614 := proc(nmax) local a,i; a := [] ; i := 1 ; while nops(a) < nmax do if numtheory[bigomega](i) = 5 then a := [op(a),i] ; fi ; i := i+1 ; end: a ; end: A114405 := proc(a014614) local a,i; a := [] ; for i from 2 to nops(a014614) do a := [op(a), op(i,a014614)-op(i-1,a014614)] ; od ; a ; end: a014614 := A014614(100000) : a114405 := A114405(a014614) : Digits := 30 : rec := -1 : for i from 1 to nops(a114405) do if evalf(a114405[i]/log(a014614[i])) > rec then printf("%d, ",a114405[i]) ; rec := evalf(a114405[i]/log(a014614[i])) ; fi ; od ; # R. J. Mathar, May 10 2007

Formula

a(n) = records in A114405(n)/log_10(A014614(n)) = records in (A014614(n+1) - A014614(n))/log_10(A014614(n)).

Extensions

a(6) from R. J. Mathar, May 10 2007
Showing 1-3 of 3 results.