login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A210660 Smallest number m such that A210659(m)=n. 1
1, 2, 6, 7, 14, 23, 86, 179, 538, 1439, 9566, 21383, 122847, 777419, 1965374, 6803099, 19860614, 26489579, 269998838, 477028439 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The sequence was discovered by Martins Opmanis.

LINKS

Table of n, a(n) for n=0..19.

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

CROSSREFS

Cf. A210659, A005245, A005520.

Sequence in context: A176279 A265739 A281167 * A226965 A128918 A078113

Adjacent sequences:  A210657 A210658 A210659 * A210661 A210662 A210663

KEYWORD

nonn

AUTHOR

Janis Iraids, Mar 28 2012

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 May 25 11:27 EDT 2020. Contains 334592 sequences. (Running on oeis4.)