|
| |
|
|
A166012
|
|
a(n) = 2*(A000045(n)-(n mod 2)) + 1 + (n mod 2).
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| This is an auxiliary sequence for computing A138606.
|
|
|
FORMULA
| a(2n) = 2*A000045(2n) + 1, a(2n+1) = 2*A000045(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]
If n mod 2 = 0 then a(n)=a(n-1)+a(n-2),else a(n)=a(n-1)+a(n-2)-1
a(n)=2*Fibonacci(n)+(1+(-1)^n)/2
a(n)=2*Fibonacci(n)+[(n+1)mod 2] [From Gary Detlefs (gdetlefs(AT)aol.com) Dec 29, 2010]
|
|
|
PROG
| (MIT Scheme:) (define (A166012 n) (+ 1 (modulo n 2) (* 2 (- (A000045 n) (modulo n 2)))))
|
|
|
CROSSREFS
| Sequence in context: A082766 A119016 A082958 * A060166 A053634 A094863
Adjacent sequences: A166009 A166010 A166011 * A166013 A166014 A166015
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Oct 05 2009
|
| |
|
|
