
1, 2, 3, 4, 5, 5, 6, 6, 6, 7, 8, 7, 8, 8, 8, 8, 9, 8, 9, 9, 9, 10, 10, 9, 10, 10, 9, 10, 11, 10, 11, 10, 11, 11, 11, 10, 11, 11, 11, 11, 12, 11, 12, 12, 11, 12, 12, 11, 12, 12, 12, 12, 12, 11, 12, 12, 12, 13, 13, 12, 13, 13, 12, 12, 13, 13, 14, 13, 13, 13, 13, 12, 13, 13, 13, 13, 14
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Janis Iraids, Table of n, a(n) for n = 1..10000
Juris Cernenoks, Janis Iraids, Martins Opmanis, Rihards Opmanis, Karlis Podnieks, Integer Complexity: Experimental and Analytical Results II, arXiv:1409.0446, 2014
Janis Iraids, A C program to compute the sequence
J. Iraids, K. Balodis, J. Cernenoks, M. Opmanis, R. Opmanis and K. Podnieks, Integer Complexity: Experimental and Analytical Results. arXiv preprint arXiv:1203.6462, 2012.  From N. J. A. Sloane, Sep 22 2012
Index to sequences related to the complexity of n


EXAMPLE

A091333(23) = 10 because 23 = (1+1+1+1) * (1+1+1) * (1+1)  1. (Note that 23 is also the smallest index at which A091333 differs from A005245.)


CROSSREFS

Cf. A005245, A025280, A091334.
Sequence in context: A200311 A007600 A195872 * A293771 A005245 A061373
Adjacent sequences: A091330 A091331 A091332 * A091334 A091335 A091336


KEYWORD

nonn


AUTHOR

Jens Voß, Dec 30 2003


STATUS

approved

