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!)
A266476 Ordinal transform of A266475. 2
1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 3, 1, 2, 3, 4, 1, 2, 1, 2, 3, 3, 4, 1, 1, 5, 4, 2, 3, 2, 4, 2, 1, 5, 5, 6, 1, 2, 3, 6, 3, 1, 4, 1, 5, 6, 3, 2, 1, 7, 7, 8, 4, 2, 2, 8, 3, 5, 4, 1, 4, 1, 5, 6, 1, 9, 7, 1, 5, 6, 8, 1, 2, 2, 2, 9, 6, 10, 7, 1, 3, 3, 3, 1, 4, 10, 3, 7, 5, 1, 6, 11, 7, 8, 4, 8, 2, 1, 9, 10, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

n is the a(n)-th positive integer having value A266475(n).

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..20000

MAPLE

g:= n-> ((l-> add(l[j]+j-1, j=1..nops(l)))(sort([seq(

        numtheory[pi](i[1])$i[2], i=ifactors(n)[2])]))):

b:= proc() 0 end:

a:= proc(n) option remember; local t;

      t:= g(n); b(t):= b(t)+1

    end:

seq(a(n), n=1..100);

MATHEMATICA

g[n_] := Function[l, Sum[l[[j]]+j-1, {j, 1, Length[l]}]][Sort[ Flatten[ Table[ Array[ PrimePi[i[[1]]]&, i[[2]]], {i, FactorInteger[n]}]]]];

b[_] = 0;

a[n_] := a[n] = With[{t = g[n]}, b[t] = b[t]+1];

Table[a[n], {n, 1, 100}] (* Jean-Fran├žois Alcover, Dec 23 2021, after Alois P. Heinz *)

CROSSREFS

Cf. A266475.

Sequence in context: A298614 A108129 A078349 * A081327 A205781 A280444

Adjacent sequences:  A266473 A266474 A266475 * A266477 A266478 A266479

KEYWORD

nonn,look

AUTHOR

Alois P. Heinz, Dec 29 2015

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 October 2 20:53 EDT 2022. Contains 357230 sequences. (Running on oeis4.)