|
| |
| |
|
|
|
11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
FORMULA
| a(n) = 1 + 10*[11|n], where [x|y] = 1 when x divides y, 0 otherwise.
a(n) = a(n-11).
Multiplicative with a(p^e, 11) = GCD(p^e, 11). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005
Dirichlet g.f. zeta(s)*(1+10/11^s). - R. J. Mathar, Apr 08 2011
a(n)= ((n-1) mod 2 + 1)*(10*floor(((n-1) mod 11)/10) + 1)[From Gary Detlefs, Dec 28 2011]
|
|
|
CROSSREFS
| Cf. A109004.
Sequence in context: A157712 A158215 A118135 * A130837 A010194 A107045
Adjacent sequences: A109011 A109012 A109013 * A109015 A109016 A109017
|
|
|
KEYWORD
| nonn,easy,mult
|
|
|
AUTHOR
| Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)
|
| |
|
|
