|
| |
| |
|
|
|
7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (0,0,0,0,0,0,1).
|
|
|
FORMULA
| a(n) = 1 + 6*[7|n], where [x|y] = 1 when x divides y, 0 otherwise.
a(n) = a(n-7).
Multiplicative with a(p^e, 7) = GCD(p^e, 7). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.
Dirichlet g.f. zeta(s)*(1+6/7^s). G.f. ( -7-x-x^2-x^3-x^4-x^5-x^6 ) / ( (x-1)*(1+x+x^2+x^3+x^4+x^5+x^6) ). - R. J. Mathar, Apr 04 2011
a(n)= 6*floor(((n-1) mod 7)/6)+1. [From Gary Detlefs, Dec 28 2011]
|
|
|
CROSSREFS
| Cf. A109004.
Sequence in context: A055061 A074465 A081229 * A117825 A010143 A101027
Adjacent sequences: A109007 A109008 A109009 * A109011 A109012 A109013
|
|
|
KEYWORD
| nonn,easy,mult
|
|
|
AUTHOR
| Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)
|
| |
|
|
