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!)
A339147 a(1) = 1; a(n) = max (A000005(n-1) , A000005(a(n-1))) , for n > 1. 1
1, 1, 2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 6, 4, 4, 4, 5, 2, 6, 4, 6, 4, 4, 3, 8, 4, 4, 4, 6, 4, 8, 4, 6, 4, 4, 4, 9, 3, 4, 4, 8, 4, 8, 4, 6, 6, 4, 3, 10, 4, 6, 4, 6, 4, 8, 4, 8, 4, 4, 3, 12, 6, 4, 6, 7, 4, 8, 4, 6, 4, 8, 4, 12, 6, 4, 6, 6, 4, 8, 4, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Empirically a(n) > A000005(n-1) for (n-1) = p, p >= 19 and for (n-1) = q^2, q >= 5; p, q primes. Also a(n) > A000005(n-1) for semiprimes (n-1) = r*s from {85,91,133,141,161,201,205,217,221,235,253,265,295,301,309,341,343,365,382,...}; r,s different primes.
LINKS
EXAMPLE
a(1) = 1; a(2) = max (A000005(1), A000005(1)) = 1; a(3) = max(A000005(2), A000005(1)) = 2; a(4) = max(A000005(3), A000005(2)) = 2; and so on.
MATHEMATICA
Module[{n=1}, NestList[Max[DivisorSigma[0, n++], DivisorSigma[0, #]]&, 1, 100]] (* Paolo Xausa, Dec 10 2023 *)
PROG
(PARI) lista(nn) = {my(va = vector(nn)); va[1] = 1; for (n=2, nn, va[n] = max(numdiv(n-1), numdiv(va[n-1])); ); va; } \\ Michel Marcus, Nov 29 2020
CROSSREFS
Cf. A000005.
Sequence in context: A339666 A318881 A280338 * A062821 A353862 A338719
KEYWORD
nonn
AUTHOR
Ctibor O. Zizka, Nov 25 2020
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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)