A059136 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A059136

A hierarchical sequence (W3{2,2}c - see A059126).

4, 10, 4, 16, 22, 16, 4, 10, 4, 28, 34, 28, 4, 10, 4, 16, 22, 16, 4, 10, 4, 40, 46, 40, 4, 10, 4, 16, 22, 16, 4, 10, 4, 28, 34, 28, 4, 10, 4, 16, 22, 16, 4, 10, 4, 52, 58, 52, 4, 10, 4, 16, 22, 16, 4, 10, 4, 28, 34, 28, 4, 10, 4, 16, 22, 16, 4, 10, 4, 40, 46, 40, 4, 10, 4, 16, 22, 16

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

LINKS

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

Jonas Wallgren, Hierarchical sequences

FORMULA

a(n) = A059128(3*n) + A059128(3*n+1) + A059128(3*n+2). - Sean A. Irvine, Sep 12 2022

CROSSREFS

Cf. A059126, A059128.

Sequence in context: A010715 A151707 A059132 * A128505 A336988 A200454

Adjacent sequences: A059133 A059134 A059135 * A059137 A059138 A059139

KEYWORD

easy,nonn

AUTHOR

Jonas Wallgren, Jan 19 2001

STATUS

approved