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!)
A163619 Let q(p) be the smallest prime greater than the prime p. A positive integer n is included in this sequence if n+1 is divisible by q(p) for each prime p dividing n. 0

%I #9 Jun 10 2023 15:56:29

%S 2,8,9,20,32,98,125,128,169,464,512,729,961,1280,2048,2108,5252,8000,

%T 8192,9728,15872,16807,18176,22385,32768,36992,50000,53792,59049,

%U 78821,81920,97556,98125,100352,124659,131072,195129,219488,223040,307328

%N Let q(p) be the smallest prime greater than the prime p. A positive integer n is included in this sequence if n+1 is divisible by q(p) for each prime p dividing n.

%C All terms of this sequence are in sequence A073606.

%e 20 is divisible by the primes 2 and 5. q(2) = 3, and q(5)=7. 20+1 = 21 is divisible by both 3 and 7, so 20 is in this sequence.

%t depQ[n_]:=With[{c=NextPrime[FactorInteger[n][[;;,1]]]},AllTrue[(n+1)/c,IntegerQ]]; Select[Range[ 2,350000],depQ] (* _Harvey P. Dale_, Jun 10 2023 *)

%Y A073606

%K nonn

%O 1,1

%A _Leroy Quet_, Aug 01 2009

%E More terms from _Sean A. Irvine_, Oct 04 2009

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 13:18 EDT 2024. Contains 375456 sequences. (Running on oeis4.)