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!)
A085641 Smallest prime == 1 (mod p*q*...*k) where p, q, ..., k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n). 1

%I #10 Apr 14 2024 00:20:02

%S 2,3,7,3,11,7,29,3,7,11,23,7,53,29,31,3,103,7,191,11,43,23,47,7,11,53,

%T 7,29,59,31,311,3,67,103,71,7,149,191,79,11,83,43,173,23,31,47,283,7,

%U 29,11,103,53,107,7,331,29,229,59,709,31,367,311,43,3,131,67,269,103,139

%N Smallest prime == 1 (mod p*q*...*k) where p, q, ..., k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n).

%C All the numbers having the same set of prime divisors are mapped to the same prime.

%F a(n) = A034694(A007947(n)).

%Y Cf. A007947.

%K easy,nonn,changed

%O 2,1

%A Amarnath Murthy, _Jason Earls_, Jul 11 2003

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 April 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)