(Translated by https://www.hiragana.jp/)
A276078 - OEIS
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276078 Numbers n in whose prime factorization no exponent of any prime(k) exceeds k. 28
1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 21, 22, 23, 25, 26, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 45, 46, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 62, 63, 65, 66, 67, 69, 70, 71, 73, 74, 75, 77, 78, 79, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95, 97, 98, 99, 101, 102, 103, 105, 106, 107, 109, 110, 111, 113, 114, 115, 117, 118, 119, 121 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers not divisible by p^(1+A000720(p)) for any prime p, where A000720(p) gives the index of prime p: 1 for 2, 2 for 3, 3 for 5, and so on.
Also Heinz numbers of integer partitions where the multiplicity of i does not exceed i for any i (A052335). Differs from A048103 in lacking {625, 1250, 1875, 3750, 4375, 5625, 6875, 8125, 8750, ...}. - Gus Wiseman, Mar 09 2019
Asymptotic density is Product_{i>=1} 1-prime(i)^(-1-i) = 0.72102334... - Amiram Eldar, Oct 20 2020
LINKS
MATHEMATICA
Select[Range@ 121, Or[# == 1, AllTrue[FactorInteger[#], PrimePi[#1] >= #2 & @@ # &]] &] (* Michael De Vlieger, Jun 24 2017 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A276078 (ZERO-POS 1 1 A276077))
(Python)
from sympy import factorint, primepi
def ok(n):
f = factorint(n)
return all(f[i] <= primepi(i) for i in f)
print([n for n in range(1, 151) if ok(n)]) # Indranil Ghosh, Jun 24 2017
(PARI) isok(n) = my(f=factor(n)); for (k=1, #f~, if (f[k, 2] > primepi(f[k, 1]), return(0))); return (1); \\ Michel Marcus, Jun 24 2017
(PARI) is(n) = {my(t=1); forprime(p = 2, , t++; pp = p^t; if(n%pp==0, return(0)); if(pp > n, return(1)))} \\ David A. Corneth, Jun 24 2017
(PARI) upto(n) = {my(v = vector(n, i, 1), t=1, res=List()); forprime(p=2, , t++; pp = p^t; if(pp>n, break); for(i=1, n\pp, v[pp*i] = 0)); for(i=1, n, if(v[i]==1, listput(res, i))); res} \\ David A. Corneth, Jun 24 2017
CROSSREFS
Positions of zeros in A276077.
Complement: A276079.
Sequence A276076 sorted into ascending order.
Subsequence of A048103 from which it differs for the first time at n=451, where a(451) = 626, while A048103(451) = 625, a value missing from here.
Sequence in context: A042968 A337037 A048103 * A193303 A285465 A092418
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 18 2016
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 26 22:10 EDT 2024. Contains 375462 sequences. (Running on oeis4.)