Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,4

LINKS

Index entries for sequences related to rooted trees

FORMULA

Partial differences of A048829. Next term is 2^61440-4092.

CROSSREFS

Sequence in context: A094211 A114573 A024035 this_sequence A135959 A114722 A105667

Adjacent sequences: A048828 A048829 A048830 this_sequence A048832 A048833 A048834

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research