Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083039
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083039 Number of divisors of n that are <= 3 +0
3
1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3 (list; graph; listen)
OFFSET

1,2

COMMENT

Periodic of period 6. Parker vector of the wreath product of S_3 and S, the symmetric group of a countable set.

LINKS

D. A. Gewurz and F. Merola, Sequences realized as Parker vectors of oligomorphic permutation groups, J. Integer Seq., 6 (2003), 03.1.6

FORMULA

G.f.: x/(1-x)+x^2/(1-x^2)+x^3/(1-x^3). a(n)=a(n-6)=a(-n).

a(n)=(1/90)*{41*(n mod 6)-19*[(n+1) mod 6]+26*[(n+2) mod 6]+11*[(n+3) mod 6]+11*[(n+4) mod 6]-4*[(n+5) mod 6]} with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Nov 27 2006

PROGRAM

(PARI) a(n)=[3, 1, 2, 2, 2, 1][n%6+1]

CROSSREFS

Cf. A083040, A000005

Sequence in context: A093116 A124369 A138258 this_sequence A106253 A078720 A083898

Adjacent sequences: A083036 A083037 A083038 this_sequence A083040 A083041 A083042

KEYWORD

easy,nonn

AUTHOR

Daniele A. Gewurz (gewurz(AT)mat.uniroma1.it) and Francesca Merola (merola(AT)mat.uniroma1.it), May 06 2003

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