This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A109014 a(n) = GCD(n,11). 3
 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; text; internal format)
 OFFSET 0,1 LINKS 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, 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). - Gary Detlefs, Dec 28 2011 CROSSREFS Cf. A109004. Sequence in context: A260237 A118135 A318671 * A268357 A321804 A321800 Adjacent sequences:  A109011 A109012 A109013 * A109015 A109016 A109017 KEYWORD nonn,easy,mult AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 10:30 EDT 2019. Contains 322328 sequences. (Running on oeis4.)