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
 25, 26, 34, 112, 53, 27, 132, 35, 28, 172, 265, 73, 192, 353, 273, 345, 267, 235, 29, 232, 347, 54, 275, 273, 36, 283, 292, 537, 277, 312, 210, 373, 355, 254, 285, 113, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A195330 gives the numbers k such that A080670(k) < k; this sequence gives the corresponding values of A080670(k). LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 (first 220 terms from Robert Price) MAPLE b:= proc(n) option remember; `if`(n=1, 1, (l->       parse(cat(seq(`if`(l[i, 2]=1, l[i, 1], [l[i, 1],       l[i, 2]][]), i=1..nops(l)))))(sort(ifactors(n)[2])))     end: g:= proc(n) option remember; local k; for k from       `if`(n=1, 0, g(n-1))+1 while b(k)>=k do od; k     end: a:= n-> b(g(n)): seq(a(n), n=1..100);  # Alois P. Heinz, Mar 17 2020 MATHEMATICA A080670 = Cases[Import["https://oeis.org/A080670/b080670.txt", "Table"], {_, _}][[All, 2]]; A195330 = Cases[Import["https://oeis.org/A195330/b195330.txt", "Table"], {_, _}][[All, 2]]; Table[A080670[[n]], {n, A195330}](* Robert Price, Mar 17 2020 *) CROSSREFS Cf. A080670, A195330. Sequence in context: A292931 A067810 A111168 * A175426 A045567 A141278 Adjacent sequences:  A195328 A195329 A195330 * A195332 A195333 A195334 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Sep 15 2011 STATUS approved

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 August 9 22:52 EDT 2020. Contains 336335 sequences. (Running on oeis4.)