Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051176
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051176 If n mod 3 = 0 then n/3 else n. +0
6
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; listen)
OFFSET

0,3

COMMENT

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.

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

CROSSREFS

Cf. A026741, A060791, A060789.

Sequence in context: A072012 A038502 A106610 this_sequence A038719 A125751 A099492

Adjacent sequences: A051173 A051174 A051175 this_sequence A051177 A051178 A051179

KEYWORD

nonn,easy,mult

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research