|
| |
|
|
A051176
|
|
If n mod 3 = 0 then n/3 else n.
|
|
11
| |
|
|
0, 1, 2, 1, 4, 5, 2, 7, 8, 3, 10, 11, 4, 13, 14, 5, 16, 17, 6, 19, 20, 7, 22, 23, 8, 25, 26, 9, 28, 29, 10, 31, 32, 11, 34, 35, 12, 37, 38, 13, 40, 41, 14, 43, 44, 15, 46, 47, 16, 49, 50, 17, 52, 53, 18, 55, 56, 19, 58, 59, 20, 61, 62, 21, 64, 65, 22, 67
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| n / GCD(n,3). Cf. A026741, A051176, A060819, A060791, A060789 for n / GCD(n,k) for k=2..6.
Multiplicative with a(3^e) = 3^(e-1), a(p^e) = p^e otherwise. Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu) Jun 09, 2005.
a(n) = A167192(n+3,3). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 30 2009]
a(n) = A109044(n)/3. Dirichlet g.f. zeta(s-1)*(1-2/3^s). - R. J. Mathar, Apr 18 2011
|
|
|
FORMULA
| G.f.: (x^5+2x^4+x^3+2x^2+x)/(1-x^3)^2. - Len Smiley (smiley(AT)math.uaa.alaska.edu), Apr 30 2001
|
|
|
MATHEMATICA
| If[Divisible[#, 3], #/3, #]&/@Range[0, 70] (* From Harvey P. Dale, Feb 07 2011 *)
|
|
|
CROSSREFS
| Cf. A026741, A060791, A060789.
Sequence in context: A172500 A038502 A106610 * A145064 A144332 A038719
Adjacent sequences: A051173 A051174 A051175 * A051177 A051178 A051179
|
|
|
KEYWORD
| nonn,easy,mult
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
