A059139 - OEIS

This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

A059139

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

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 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,1`
	COMMENTS	`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)).`
	LINKS	`Table of n, a(n) for n=0..92.` `Ralf Stephan, Some divide-and-conquer sequences ...` `J. Wallgren, Hierarchical sequences`
	FORMULA	`a(n) = 4 + 3*A007814(n). a(2n) = 4, a(2n+1) = a(n) + 3. - Ralf Stephan, Oct 09 2003`
	CROSSREFS	`Sequence in context: A021682 A242187 A094692 * A110669 A106027 A101159` `Adjacent sequences: A059136 A059137 A059138 * A059140 A059141 A059142`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jonas Wallgren, Jan 19 2001`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 04:14 EST 2019. Contains 319323 sequences. (Running on oeis4.)