login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081376 a(n) is the least number such that A067003[a(n)] = n. 0
1, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 62, 63, 65, 68, 69, 72, 74, 75, 76, 77, 80, 82, 85, 86, 87, 88, 91, 92, 93, 94, 95, 96, 98, 99, 100, 104, 106, 108, 111, 112, 115, 116, 117, 118, 119, 122, 123 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..68.

MATHEMATICA

g[x_] := Length[FactorInteger[x]] f[x_] := Count[Table[g[j] - g[x], {j, 1, x}], 0] Table[f[w], {w, 1, 100}]

CROSSREFS

Cf. A067003, A081373-A081375, A001221.

Sequence in context: A139711 A214585 A196036 * A055074 A035059 A137832

Adjacent sequences:  A081373 A081374 A081375 * A081377 A081378 A081379

KEYWORD

nonn

AUTHOR

Labos Elemer, Mar 24 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 03:06 EST 2019. Contains 329216 sequences. (Running on oeis4.)