A103586 a(0)=1, for n > 0: n-th run consists of 2^n-1 copies of n+1.
1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
Offset: 0
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
- David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
- David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
- O. Kullmann and X. Zhao, Bounds for variables with few occurrences in conjunctive normal forms, arXiv preprint arXiv:1408.0629 [math.CO], 2014-2017.
- Ana Luzón, Manuel A. Morón, and Luis Felipe Prieto-Martínez, Commutators and commutator subgroups of the Riordan group, (2021).
- Index entries for sequences related to binary expansion of n
Programs
-
Haskell
a103586 n = a070939 (n + a070939 n) a103586_list = 1 : concat (zipWith (replicate . fromInteger) (tail a000225_list) [2..]) -- Reinhard Zumkeller, Jul 21 2012
-
Mathematica
Join[{1},Flatten[Table[PadRight[{},2^n-1,n+1],{n,6}]]] (* Harvey P. Dale, Aug 22 2021 *) -
Python
def A103586(n): return (m:=n.bit_length())+(n>=(1<
Formula
Extensions
a(0) = 1 added, definition and offset adjusted by Reinhard Zumkeller, Jul 21 2012
Comments