The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A195331 A080670 applied to A195330(n). 3

%I

%S 25,26,34,112,53,27,132,35,28,172,265,73,192,353,273,345,267,235,29,

%T 232,347,54,275,273,36,283,292,537,277,312,210,373,355,254,285,113,

%U 372,236,293,412,357,573,287,432,354,211,37,133,472,74,2355,2254,295,2534,2583,2113,2372,2373,2643,532,2811,2589,2236,2723,2647,2103,2597,55,2672,2752,2813,2412,3353,2653,2357,2573,2733,592,3443,297,365,2432,2729,612,2354,2659,3447,2835,2435,2661,2731

%N A080670 applied to A195330(n).

%C A195330 gives the numbers k such that A080670(k) < k; this sequence gives the corresponding values of A080670(k).

%H Alois P. Heinz, <a href="/A195331/b195331.txt">Table of n, a(n) for n = 1..10000</a> (first 220 terms from Robert Price)

%p b:= proc(n) option remember; `if`(n=1, 1, (l->

%p parse(cat(seq(`if`(l[i, 2]=1, l[i, 1], [l[i, 1],

%p l[i, 2]][]), i=1..nops(l)))))(sort(ifactors(n)[2])))

%p end:

%p g:= proc(n) option remember; local k; for k from

%p `if`(n=1, 0, g(n-1))+1 while b(k)>=k do od; k

%p end:

%p a:= n-> b(g(n)):

%p seq(a(n), n=1..100); # _Alois P. Heinz_, Mar 17 2020

%t A080670 = Cases[Import["https://oeis.org/A080670/b080670.txt", "Table"], {_, _}][[All, 2]];

%t A195330 = Cases[Import["https://oeis.org/A195330/b195330.txt", "Table"], {_, _}][[All, 2]];

%t Table[A080670[[n]], {n, A195330}](* _Robert Price_, Mar 17 2020 *)

%Y Cf. A080670, A195330.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, Sep 15 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 19:04 EDT 2020. Contains 337387 sequences. (Running on oeis4.)