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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047592 Numbers that are congruent to {1, 2, 3, 4, 5, 6, 7} mod 8. 2
1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 81 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Or, numbers that are not multiples of 8. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009

More generally the sequence of numbers not divisible by some fixed integer m>=2 is given by a(n,m)=n-1+floor((n+m-2)/(m-1)). [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]

Complement of A008590; A168181(a(n)) = 1. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2009]

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (1,0,0,0,0,0,1,-1).

FORMULA

a(n) = n-1+floor((n+6)/7). [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]

a(n) = +a(n-1) +a(n-7) -a(n-8). G.f. x*(1+x)*(1+x^2)*(1+x^4) / ( (x^6+x^5+x^4+x^3+x^2+x+1) *(x-1)^2 ). - R. J. Mathar, Mar 08 2011

MATHEMATICA

Complement[Range[88], 8Range[11]] [From Harvey P. Dale, Jan 22 2011]

PROG

(PARI) a(n)=n-1+floor((n+6)/7) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]

(MAGMA) [ n: n in [0..100] | n mod 8 in {1, 2, 3, 4, 5, 6, 7} ]; [From Vincenzo Librandi, Dec 25 2010]

CROSSREFS

Sequence in context: A020661 A068937 A182768 * A187320 A043093 A023802

Adjacent sequences:  A047589 A047590 A047591 * A047593 A047594 A047595

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:16 EST 2012. Contains 205856 sequences.