Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048832
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048832 Number of rooted identity game trees of height n, first player to reach to reach top wins. First player wins. +0
3
0, 1, 1, 10, 61428 (list; graph; listen)
OFFSET

0,4

LINKS

Index entries for sequences related to rooted trees

FORMULA

Partial differences of A048830. Next term is 2^65536-2^61440-61440.

CROSSREFS

Sequence in context: A092300 A048916 A055310 this_sequence A115673 A013792 A139106

Adjacent sequences: A048829 A048830 A048831 this_sequence A048833 A048834 A048835

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jun 15 1999.

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research