|
Search: id:A061373
|
|
|
| A061373 |
|
"Natural" logarithm, defined inductively by a(1)=1, a(p)=1+a(p-1) if p is prime, and a(n*m)=a(n)+a(m) if n, m>1. |
|
+0
7
|
|
| 1, 2, 3, 4, 5, 5, 6, 6, 6, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 10, 11, 9, 10, 10, 9, 10, 11, 10, 11, 10, 11, 11, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 11, 13, 14, 11, 12, 12, 12, 12, 13, 11, 13, 12, 12, 13, 14, 12, 13, 13, 12, 12, 13, 13, 14, 13, 14, 13, 14, 12, 13, 13, 13, 13, 14
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Related to A005245, the complexity of n, which is <= this sequence. They are equal up to term a(46) and for 771 values out of the first 1000 terms. A061373 is easier to compute.
|
|
REFERENCES
|
J. Arias de Reyna, Complejidad de los numeros naturales, Gaceta de la Real Sociedad Matematica Espanola, 3, (2000), 230-250
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
|
|
CROSSREFS
|
Cf. A005245.
Sequence in context: A007600 A091333 A005245 this_sequence A104135 A046108 A079411
Adjacent sequences: A061370 A061371 A061372 this_sequence A061374 A061375 A061376
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
Juan Arias-de-Reyna (arias(AT)cica.es), Jun 08 2001
|
|
|
Search completed in 0.002 seconds
|
