|
Search: id:A047592
|
|
|
| A047592 |
|
Numbers that are congruent to {1, 2, 3, 4, 5, 6, 7} mod 8. |
|
+0
3
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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]
|
|
FORMULA
|
a(n)=n-1+floor((n+6)/7) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
PROGRAM
|
(PARI) a(n)=n-1+floor((n+6)/7) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
CROSSREFS
|
Sequence in context: A118065 A020661 A068937 this_sequence A043093 A023802 A007915
Adjacent sequences: A047589 A047590 A047591 this_sequence A047593 A047594 A047595
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
