(Translated by https://www.hiragana.jp/)
A068435 -id:A068435 - 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!)
Search: a068435 -id:a068435
Displaying 1-6 of 6 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A116086 Perfect powers n with no primes between n and the next larger perfect power, which is in A116455. +10
4
8, 25, 32, 121, 2187, 3125, 32761, 79507, 97336, 503284356 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
No other n<10^12. There is a conjecture that this sequence is finite.
No other terms < 10^18. - Jud McCranie, Nov 03 2013
No other terms < 4.5*10^18. - Giovanni Resta, Apr 28 2014
LINKS
EXAMPLE
The prime-free ranges are (2^3,3^2), (5^2,3^3), (2^5,6^2), (11^2,5^3), (3^7,13^3), (5^5,56^2), (181^2,2^15), (43^3,282^2), (46^3,312^2), (22434^2,55^5).
MATHEMATICA
lim=10^12; lst={}; k=2; While[n=Floor[lim^(1/k)]; n>=2, lst=Join[lst, Range[2, n]^k]; k++ ]; lst=Union[lst]; PrimeFree[n1_, n2_] := Module[{n=n1+1}, While[n<n2&&!PrimeQ[n], n++ ]; n ==n2]; lst2={}; Do[If[PrimeFree[lst[[i]], lst[[i+1]]], AppendTo[lst2, lst[[i]]]], {i, Length[lst]-1}]; lst2
CROSSREFS
Cf. A001597 (perfect powers), A116455.
Cf. A068435 (for prime powers).
KEYWORD
hard,nonn
AUTHOR
T. D. Noe, Mar 28 2006
STATUS
approved
A366835 In the pair (A246655(n), A246655(n+1)), how many primes are there? +10
4
2, 1, 1, 2, 1, 0, 1, 2, 1, 1, 2, 2, 1, 0, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
First 0 terms appear at n = 6, 14, 41, 359, 3589, corresponding to consecutive prime powers (8,9), (25,27), (121,125), (2187,2197) and (32761,32768), respectively (cf. A068315 and A068435).
LINKS
Michael De Vlieger, 1038 X 1038 raster of a(n), n = 1..1077444, read left to right in rows, then top to bottom, showing a(n) = 0 in white, a(n) = 1 in red, and a(n) = 2 in dark blue.
EXAMPLE
a(1) = 2 because in the first prime power pair (2 and 3) there are two primes.
a(14) = 0 because in the 14th prime power pair (25 and 27) there are no primes.
MATHEMATICA
With[{upto=500}, Map[Count[#, _?PrimeQ]&, Partition[Select[Range[upto], PrimePowerQ], 2, 1]]] (* Considers prime powers up to 500 *)
PROG
(PARI) lista(nn) = my(v=[p| p <- [1..nn], isprimepower(p)]); vector(#v-1, k, isprime(v[k]) + isprime(v[k+1])); \\ Michel Marcus, Oct 26 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Paolo Xausa, Oct 25 2023
STATUS
approved
A116455 Perfect powers n with no primes between n and the next smaller perfect power, which is in A116086. +10
3
9, 27, 36, 125, 2197, 3136, 32768, 79524, 97344, 503284375 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
No other terms < 10^18. - Jud McCranie, Nov 03 2013
No other terms < 4.5*10^18. - Giovanni Resta, Apr 28 2014
LINKS
CROSSREFS
Cf. A001597 (perfect powers), A116086.
Cf. A068435 (for prime powers).
KEYWORD
hard,nonn
AUTHOR
T. D. Noe, Mar 28 2006
STATUS
approved
A366833 Number of times n appears in A362965 (number of primes <= the n-th prime power). +10
3
1, 2, 1, 3, 1, 2, 1, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) can be only 1, 2, or 3, with the first occurrences of 3 appearing at n = 4, 9, 30, 327 and 3512.
LINKS
Paolo Xausa, 1200 X 1200 raster image of a(n), n = 1..1440000, read left to right, top to bottom, showing a(n) = 1 in blue, a(n) = 2 in white and a(n) = 3 in red.
MATHEMATICA
With[{upto=1000}, Map[Length, Most[Split[PrimePi[Select[Range[upto], PrimePowerQ]]]]]] (* Considers prime powers up to 1000 *)
CROSSREFS
Run lengths of A362965.
KEYWORD
nonn
AUTHOR
Paolo Xausa, Oct 25 2023
STATUS
approved
A060846 Smallest prime > a nontrivial power of a prime. +10
2
5, 11, 11, 17, 29, 29, 37, 53, 67, 83, 127, 127, 131, 173, 251, 257, 293, 347, 367, 521, 541, 631, 733, 853, 967, 1031, 1361, 1373, 1693, 1861, 2053, 2203, 2203, 2213, 2411, 2819, 3137, 3491, 3727, 4099, 4493, 4919, 5051, 5333, 6247, 6563, 6863, 6899, 7927 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = nextprime(A025475(n+1)) = A007918(A025475(n+1)) = Min{p| p>A025475(n+1)}. [corrected by Michel Marcus, Aug 24 2019]
EXAMPLE
78125=5^7 is followed by 78137.
PROG
(PARI) ispp(x) = !isprime(x) && isprimepower(x);
lista(nn) = apply(x->nextprime(x), select(x->ispp(x), [1..nn])); \\ Michel Marcus, Aug 24 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, May 03 2001
STATUS
approved
A068315 For numbers k such that A025474(k) > 1 and A025474(k+1) > 1, sequence gives A000961(k). +10
2
8, 25, 121, 2187, 32761 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Equivalently, prime powers (either A000961 or A246655) q such that q and the next prime power are both composite numbers. - Paolo Xausa, Oct 25 2023
LINKS
MATHEMATICA
With[{upto=33000}, Map[First, Select[Partition[Select[Range[upto], PrimePowerQ], 2, 1], NoneTrue[#, PrimeQ]&]]] (* Paolo Xausa, Oct 25 2023 *)
CROSSREFS
Bisection of A068435.
KEYWORD
nonn,hard,more
AUTHOR
Naohiro Nomoto, Mar 08 2002
EXTENSIONS
Definition corrected by Jinyuan Wang, Sep 05 2020
STATUS
approved
page 1

Search completed in 0.065 seconds

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 September 2 05:36 EDT 2024. Contains 375604 sequences. (Running on oeis4.)