id:A166012 - OEIS Search Results

Search: id:A166012

Displaying 1-1 of 1 results found.

page 1

a(n) = 2*(A000045(n)-(n mod 2)) + 1 + (n mod 2).

+0
2

1, 2, 3, 4, 7, 10, 17, 26, 43, 68, 111, 178, 289, 466, 755, 1220, 1975, 3194, 5169, 8362, 13531, 21892, 35423, 57314, 92737, 150050, 242787, 392836, 635623, 1028458, 1664081, 2692538, 4356619, 7049156, 11405775, 18454930, 29860705 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`This is an auxiliary sequence for computing A138606.`
	FORMULA	`a(2n) = 2A000045(2n) + 1, a(2n+1) = 2A000045(2n+1).` `Without reference to A000045: a(n)=2*Floor(a(n-1)/2)+a(n-2). [From Clark Kimberling (ck6(AT)evansville.edu), Nov 07 2009]`
	PROGRAM	`(MIT Scheme:) (define (A166012 n) (+ 1 (modulo n 2) (* 2 (- (A000045 n) (modulo n 2)))))`
	CROSSREFS	`Sequence in context: A119016 A082766 A082958 this_sequence A060166 A053634 A094863` `Adjacent sequences: A166009 A166010 A166011 this_sequence A166013 A166014 A166015`
	KEYWORD	`nonn,new`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Oct 05 2009`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research