A059141 -id:A059141 - cp's OEIS frontend

A059134 A hierarchical sequence (W2{3}c - see A059126).

11, 32, 11, 53, 11, 32, 11, 74, 11, 32, 11, 53, 11, 32, 11, 95, 11, 32, 11, 53, 11, 32, 11, 74, 11, 32, 11, 53, 11, 32, 11, 116, 11, 32, 11, 53, 11, 32, 11, 74, 11, 32, 11, 53, 11, 32, 11, 95, 11, 32, 11, 53, 11, 32, 11, 74, 11, 32, 11, 53, 11, 32, 11, 137, 11, 32, 11, 53, 11

Offset: 0

Jonas Wallgren, Jan 19 2001

Jonas Wallgren, Hierarchical sequences

Cf. A059126, A059127.

Cf. A059141 (7*p+11), A059144 (9*p+15), A220466. - Johannes W. Meijer, Jan 21 2013

nmax:=68: for p from 0 to ceil(simplify(log[2](nmax))) do for n from 0 to ceil(nmax/(p+2))+1 do a((2*n+1)*2^p-1) := 21*p+11 od: od: seq(a(n), n=0..nmax); # Johannes W. Meijer, Jan 21 2013

a((2*n+1)*2^p-1) = 21*p+11 for p >= 0. - Johannes W. Meijer, Jan 21 2013

a(n) = Sum_{k=0..6} A059127(7*n+k). - Sean A. Irvine, Sep 12 2022

A059139 A hierarchical sequence (W2{2}*c - see A059126).

Original entry on oeis.org

4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 16, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 19, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 16, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 22, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4, 7, 4, 16, 4, 7, 4, 10, 4, 7, 4, 13, 4, 7, 4, 10, 4

Offset: 0

Jonas Wallgren, Jan 19 2001

Let the general sequence H(a,b,n) = a*A007814(n+1) + b, then this sequence is H(3,4). Other hierarchical sequences of this type are A059132 (H(6,4)), A059141 (H(7,11)), A059144 (H(9,15)), A059134 (H(21,11)), A059137 (H(36,18)).

Ralf Stephan, Some divide-and-conquer sequences ...
J. Wallgren, Hierarchical sequences

a(n) = 4 + 3*A007814(n). a(2n) = 4, a(2n+1) = a(n) + 3. - Ralf Stephan, Oct 09 2003

cp's OEIS Frontend

A059134 A hierarchical sequence (W2{3}c - see A059126).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Formula