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!)
A081376 a(n) is the least number such that A067003[a(n)] = n. 0

%I #4 Oct 15 2013 22:31:51

%S 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,

%T 52,54,55,56,57,58,62,63,65,68,69,72,74,75,76,77,80,82,85,86,87,88,91,

%U 92,93,94,95,96,98,99,100,104,106,108,111,112,115,116,117,118,119,122,123

%N a(n) is the least number such that A067003[a(n)] = n.

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

%Y Cf. A067003, A081373-A081375, A001221.

%K nonn

%O 1,2

%A _Labos Elemer_, Mar 24 2003

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 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)