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!)
A052499 If n is in the sequence then so are 2n and 4n-1. 3

%I #37 Jul 08 2022 12:41:30

%S 1,2,3,4,6,7,8,11,12,14,15,16,22,23,24,27,28,30,31,32,43,44,46,47,48,

%T 54,55,56,59,60,62,63,64,86,87,88,91,92,94,95,96,107,108,110,111,112,

%U 118,119,120,123,124,126,127,128,171,172,174,175,176,182,183,184,187

%N If n is in the sequence then so are 2n and 4n-1.

%C Theorem (J.-P. Allouche, J. Shallit, G. Skordev): This sequence = 1 + A003754.

%H Reinhard Zumkeller, <a href="/A052499/b052499.txt">Table of n, a(n) for n = 0..10000</a>

%H J.-P. Allouche, J. Shallit and G. Skordev, <a href="http://dx.doi.org/10.1016/j.disc.2004.12.004">Self-generating sets, integers with missing blocks and substitutions</a>, Discrete Math. 292 (2005) 1-15.

%H David Garth and Adam Gouge, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Garth/garth14.html">Affinely Self-Generating Sets and Morphisms</a>, Journal of Integer Sequences, 10 (2007) 1-13.

%H Andreas M. Hinz and Paul K. Stockmeyer, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL25/Hinz/hinz5.html">Precious Metal Sequences and Sierpinski-Type Graphs</a>, J. Integer Seq., Vol 25 (2022), Article 22.4.8.

%H T. Karki, A. Lacroix, M. Rigo, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL13/Rigo/rigo6.html">On the recognizability of self-generating sets</a>, JIS 13 (2010) #10.2.2.

%H C. Kimberling, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/goldentext.html">A Self-Generating Set and the Golden Mean</a>, J. Integer Sequences, 3 (2000), #00.2.8.

%F a(A001911(n)) = 2^n.

%e a(9)=14 is in the sequence because 14=2*(4*(2*1)-1).

%t 1 + Select[ Range[0, 200], FreeQ[ IntegerDigits[#, 2], {___, 0, 0, ___} ] & ] (* _Jean-François Alcover_, Jan 20 2012, after J.-P. Allouche *)

%t a[1] = 1; a[n_] := a[n] = a[n - 1] + Ceiling[2^IntegerExponent[a[n - 1], 2]/3]; Array[a, 200] (* _Birkas Gyorgy_, May 30 2012 *)

%o (Haskell)

%o import Data.Set (singleton, deleteFindMin, insert)

%o a052499 n = a052499_list !! n

%o a052499_list = f $ singleton 1 where

%o f s = m : f (insert (2*m) $ insert (4*m-1) s') where

%o (m, s') = deleteFindMin s

%o -- _Reinhard Zumkeller_, Jul 06 2011

%Y Cf. A001911, A003754.

%K nonn,nice

%O 0,2

%A _Henry Bottomley_, Mar 15 2000

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 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)