|
| |
|
|
A047406
|
|
Numbers that are congruent to {4, 6} mod 8.
|
|
2
| |
|
|
4, 6, 12, 14, 20, 22, 28, 30, 36, 38, 44, 46, 52, 54, 60, 62, 68, 70, 76, 78, 84, 86, 92, 94, 100, 102, 108, 110, 116, 118, 124, 126, 132, 134, 140, 142, 148, 150, 156, 158, 164, 166, 172, 174, 180, 182, 188, 190, 196, 198, 204, 206, 212, 214, 220, 222, 228
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| In groups of four add the odd and even numbers (4=1+3, 6=2+4; 12=5+7, 14=6+8; etc.), George E. Antoniou (george.antoniou(AT)montclair.edu), Dec 12 2001.
The first 250 terms (4 through 998) are the 250 non-occurring Fibonacci number residues modulo 1000; i.e., if leading zeros are supplied as necessary for the terms having fewer than three digits, these are the 250 sets of three digits that never appear as the last three digits of a Fibonacci number. [From Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jul 05 2010]
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (1,1,-1).
|
|
|
FORMULA
| a(n) = A042964(n)*2.
a(n)=(4*n - 1 - (-1)^n) [From Jon E. Schoenfield (jonscho(AT)hiwaay.net), Jul 05 2010]
a(n)=8*n-a(n-1)-6 (with a(1)=4) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 05 2010]
G.f. 2*x*(2+x+x^2) / ( (1+x)*(x-1)^2 ). - R. J. Mathar, Oct 08 2011
|
|
|
EXAMPLE
| For n=2, a(2)=8*2-4-6=6; n=3, a(3)=8*3-6-6=12; n=4, a(4)=8*4-12-6=14 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Aug 05 2010]
|
|
|
CROSSREFS
| Sequence in context: A163097 A110178 A140599 * A136415 A059891 A020213
Adjacent sequences: A047403 A047404 A047405 * A047407 A047408 A047409
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
