Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102709
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A102709
%S A102709 3125,1075,985,580,1281,295,1305,580,925,631,1305,220,1305,655,901,580,
%T A102709 1305,295,1305,556,925,655,1305,220,1281,655,925,580,1305,271,1305,580,
%U A102709 925,655,1281,220,1305,655,925,556,1305,295,1305,580,901,655,1305,220
%N A102709 Let a(n,m) = card{f^(n) : f is a mapping from a set of m elements into 
               itself}, where f^(l)(x) = f^(l-1)(f(x)),l>0, f^(0)(x) = x; sequence 
               gives a(n,5).
%C A102709 Sequence appears to have a rational o.g.f. - Ralf Stephan, May 18 2007
%Y A102709 Cf. A102687.
%Y A102709 Sequence in context: A002433 A107535 A133526 this_sequence A057067 A084649 
               A016817
%Y A102709 Adjacent sequences: A102706 A102707 A102708 this_sequence A102710 A102711 
               A102712
%K A102709 nonn
%O A102709 1,1
%A A102709 Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 05 2005

    
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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research