Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066387
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066387 Triangle T(n,m) (1<=m<=n) giving number of maps f:N -> N such that f^m(X)=X+n for all natural numbers X. +0
1
1, 1, 2, 1, 0, 6, 1, 12, 0, 24, 1, 0, 0, 0, 120, 1, 120, 360, 0, 0, 720, 1, 0, 0, 0, 0, 0, 5040, 1, 1680, 0, 20160, 0, 0, 0, 40320, 1, 0, 60480, 0, 0, 0, 0, 0, 362880, 1, 30240, 0, 0, 1814400, 0, 0, 0, 0, 3628800, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39916800 (list; table; graph; listen)
page 1

Search completed in 0.001 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 December 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research