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!)
A272600 Composites k such that p-1 divides k-1 for each prime divisor of k-1. 2
9, 21, 25, 33, 49, 55, 65, 81, 85, 121, 129, 145, 161, 169, 201, 217, 221, 253, 273, 289, 295, 301, 321, 325, 343, 361, 385, 441, 469, 481, 501, 505, 513, 545, 589, 625, 649, 685, 721, 781, 801, 817, 841, 865, 901, 961, 973, 1001, 1025, 1027, 1081, 1089, 1101, 1135, 1177, 1261, 1281, 1333, 1345, 1369, 1405, 1441, 1501 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Composites not in A272601.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
pdkQ[n_]:=Module[{p=FactorInteger[n-1][[;; , 1]]-1}, AllTrue[(n-1)/p, IntegerQ]]; Select[Range[ 1550], CompositeQ[#]&&pdkQ[#]&] (* Harvey P. Dale, Feb 26 2024 *)
PROG
(PARI) forcomposite(n=4, 10^4, my(q=1, f=factor(n-1)[, 1]); for(j=1, #f, if((n-1)%(f[j]-1), q=0; break)); if(q, print1(n, ", ") ) );
(PARI) is(n)=my(f=factor(n-1)[, 1]); for(i=1, #f, if((n-1)%(f[i]-1), return(0))); !isprime(n) && n>1 \\ Charles R Greathouse IV, May 16 2016
CROSSREFS
Cf. A080062 (composite n such that p-1 divides n-1 for each prime divisor of n).
Sequence in context: A143791 A091113 A188159 * A359161 A327862 A108181
KEYWORD
nonn
AUTHOR
Joerg Arndt, May 16 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 9 01:49 EDT 2024. Contains 375024 sequences. (Running on oeis4.)