A085193 - OEIS

This site is supported by donations to The OEIS Foundation.

A085193

Repeating part of A085192.

2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 58, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 26, 2, 6, 2, 4, 10, 2, 4, 8, 18, 2, 4, 8, 16, 202, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 58, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10, 2, 4, 8, 26, 2, 6, 2, 4, 10, 2, 4, 8, 18, 2, 4, 8, 16, 74, 2, 6, 2, 4, 18, 2, 6, 2, 4, 10 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,1`
	LINKS	`Table of n, a(n) for n=0..93.` `A. Karttunen, Notes concerning A080237-tree and related sequences.`
	FORMULA	`a(n) = A085192(A081291(n+1)-1)` `a(n) = 4*A085193(A085182(n+1)-1) + 2 - (2^A007001(n+1)) if A007001(n+2)==1, otherwise 2^A007001(n+1).`
	PROG	`(MIT Scheme) (define (A085193 nn) (let ((n (1+ nn))) (cond ((= 1 (A007001 (+ n 1))) (- (* 4 (A085193 (-1+ (A085182 n)))) (- (expt 2 (A007001 n)) 2))) (else (expt 2 (A007001 n))))))`
	CROSSREFS	`Same sequence divided by 2: A085194. Cf. A085190.` `Sequence in context: A194953 A057606 A021385 * A220242 A220375 A220430` `Adjacent sequences: A085190 A085191 A085192 * A085194 A085195 A085196`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Jun 14 2003`
	STATUS	`approved`

Content is available under The OEIS End-User License Agreement .

Last modified June 17 23:56 EDT 2013. Contains 226327 sequences.