login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047574 Numbers that are congruent to {5, 6, 7} mod 8. 2
5, 6, 7, 13, 14, 15, 21, 22, 23, 29, 30, 31, 37, 38, 39, 45, 46, 47, 53, 54, 55, 61, 62, 63, 69, 70, 71, 77, 78, 79, 85, 86, 87, 93, 94, 95, 101, 102, 103, 109, 110, 111, 117, 118, 119, 125, 126, 127, 133, 134, 135, 141, 142, 143, 149, 150, 151, 157, 158, 159 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (1,0,1,-1).

FORMULA

From Chai Wah Wu, May 30 2016: (Start)

a(n) = a(n-1) + a(n-3) - a(n-4) for n>4.

G.f.: x*(x^3 + x^2 + x + 5)/(x^4 - x^3 - x + 1). (End)

a(n) = (8*n-10*sin(2*Pi*(n+1)/3)/sqrt(3)+2)/3. - Ilya Gutkovskiy, May 30 2016

a(n) = 8*floor((n-1)/3)+((n-1) mod 3)+5. - David A. Corneth, May 30 2016

a(3k) = 8k-1, a(3k-1) = 8k-2, a(3k-2) = 8k-3. - Wesley Ivan Hurt, Jun 10 2016

MAPLE

A047574:=n->8*floor((n-1)/3)+((n-1) mod 3)+5: seq(A047574(n), n=1..100); # Wesley Ivan Hurt, Jun 10 2016

MATHEMATICA

Select[Range[200], MemberQ[{5, 6, 7}, Mod[#, 8]] &] (* Vincenzo Librandi, May 30 2016 *)

LinearRecurrence[{1, 0, 1, -1}, {5, 6, 7, 13}, 60] (* Harvey P. Dale, Jul 29 2016 *)

PROG

(MAGMA) [n: n in [0..200] | n mod 8 in [5..7]]; // Vincenzo Librandi, May 30 2016

(PARI) a(n)=8 * (n-1)\3 + (n-1)%3 + 5 \\ David A. Corneth, May 30 2016

CROSSREFS

Sequence in context: A165776 A003273 A006991 * A273929 A067531 A031029

Adjacent sequences:  A047571 A047572 A047573 * A047575 A047576 A047577

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 15:25 EST 2016. Contains 278781 sequences.