login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047337 Numbers that are congruent to {0, 1, 2, 3, 4} mod 7. 1
0, 1, 2, 3, 4, 7, 8, 9, 10, 11, 14, 15, 16, 17, 18, 21, 22, 23, 24, 25, 28, 29, 30, 31, 32, 35, 36, 37, 38, 39, 42, 43, 44, 45, 46, 49, 50, 51, 52, 53, 56, 57, 58, 59, 60, 63, 64, 65, 66, 67, 70, 71, 72, 73, 74, 77, 78 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..57.

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

FORMULA

a(n) = 7*floor((n-1)/5) + ((n-1) mod 5). - Gary Detlefs, Mar 09 2010

G.f.: x^2*(1 + x + x^2 + x^3 + 3*x^4) / ( (1 + x + x^2 + x^3 + x^4)*(x-1)^2 ). - R. J. Mathar, Dec 04 2011

a(n) = floor((7/6)*floor(6*(n-1)/5)). - Bruno Berselli, May 03 2016

MATHEMATICA

DeleteCases[Range[0, 80], _?(Mod[#, 7]>4&)] (* Harvey P. Dale, Aug 21 2013 *)

PROG

(MAGMA) [n: n in [0..150] | n mod 7 in [0..4]]; // Vincenzo Librandi, May 04 2016

CROSSREFS

Sequence in context: A039074 A326966 A326784 * A039049 A037466 A285405

Adjacent sequences:  A047334 A047335 A047336 * A047338 A047339 A047340

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 03:23 EST 2021. Contains 349625 sequences. (Running on oeis4.)