|
Search: id:A047253
|
|
|
| A047253 |
|
Numbers that are congruent to {1, 2, 3, 4, 5} mod 6. |
|
+0
6
|
|
| 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 85, 86
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Numbers that are not divisible by 6. [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
More generally the sequence a(n,m) 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]
|
|
FORMULA
|
a(n)=5+a(n-5). G.f.: (1+x+x^2+x^3+x^4+x^5)/((1-x)*(1-x^5)).
a(n)=n-1+floor((n+4)/5) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
PROGRAM
|
(PARI) a(n)= 1+n+n\5
(PARI) a(n)=n-1+floor((n+4)/5) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
CROSSREFS
|
Cf. A097325.
Sequence in context: A108120 A108586 A039215 this_sequence A037918 A043091 A031943
Adjacent sequences: A047250 A047251 A047252 this_sequence A047254 A047255 A047256
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 18 2008
|
|
|
Search completed in 0.002 seconds
|
