Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003510
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003510 An equivalence relation on permutations.
(Formerly M1510)
+0
2
1, 1, 2, 5, 17, 67, 352, 1969, 13295, 97619, 848354, 7647499, 82862683, 897904165, 11226063188, 146116260203, 2089038231953, 30230018309161, 508450431515290, 8318618236423861, 154636109939564681, 2896102013935844771, 59056861862689101272 (list; graph; listen)
OFFSET

0,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. P. Stanley, Problem 5932, Amer. Math. Monthly, 82 (1975), 86-87.

R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 5.18.

FORMULA

E.g.f.: exp ( Sum_{i=1..inf} x^i / i*phi(i) ), phi = Euler phi function (A000010).

MAPLE

with(numtheory); exp(add(x^n/(n*phi(n)), n=1..31));

CROSSREFS

Sequence in context: A104082 A166474 A054769 this_sequence A051625 A056098 A027361

Adjacent sequences: A003507 A003508 A003509 this_sequence A003511 A003512 A003513

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research