login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064923 a(n) = Min { k | A064920(k) = n }. 4

%I #9 Jun 19 2018 05:15:30

%S 2,3,6,5,10,7,14,16,24,11,22,13,26,39,52,17,34,19,38,57,76,23,46,69,

%T 72,115,120,29,58,31,62,64,96,155,160,37,74,111,148,41,82,43,86,129,

%U 172,47,94,141,144,235,240,53,106,159,162,265,270,59,118,61,122,183,244

%N a(n) = Min { k | A064920(k) = n }.

%C A064920(a(n)) = n. a(n) = n iff n is prime.

%H Harry J. Smith, <a href="/A064923/b064923.txt">Table of n, a(n) for n = 2..1000</a>

%o (PARI) gpf(n)= { local(f); f=factor(n)~; return(f[1, length(f)]) } { for (n=2, 1000, k=1; until (m==n, k++; g=gpf(k); m=k / g + g - 1); write("b064923.txt", n, " ", k) ) } \\ _Harry J. Smith_, Sep 29 2009

%Y Cf. A064920, A064924, A064919.

%K nonn

%O 2,1

%A _Reinhard Zumkeller_, Oct 14 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 18 16:09 EDT 2024. Contains 376000 sequences. (Running on oeis4.)