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!)
A210660 Smallest number m such that A210659(m)=n. 1

%I #18 Oct 20 2014 17:15:14

%S 1,2,6,7,14,23,86,179,538,1439,9566,21383,122847,777419,1965374,

%T 6803099,19860614,26489579,269998838,477028439

%N Smallest number m such that A210659(m)=n.

%C The sequence was discovered by _Martins Opmanis_.

%H J. Iraids, K. Balodis, J. Cernenoks, M. Opmanis, R. Opmanis and K. Podnieks, <a href="http://arxiv.org/abs/1203.6462">Integer Complexity: Experimental and Analytical Results</a>. arXiv preprint arXiv:1203.6462, 2012. - From _N. J. A. Sloane_, Sep 22 2012

%H <a href="/index/Com#complexity">Index to sequences related to the complexity of n</a>

%Y Cf. A210659, A005245, A005520.

%K nonn

%O 0,2

%A _Janis Iraids_, Mar 28 2012

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)