Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089834
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089834 Number of distinct non-recursive gatomorphisms whose minimum clause-representation requires examination of n nodes in total and which require more than one non-default clause. +0
2
0, 0, 10, 139, 2570, 48782, 1038146 (list; graph; listen)
OFFSET

1,3

COMMENT

Row sums of A089831 excluding the first column.

CROSSREFS

a(n) = A089832(n)-A089833(n).

Sequence in context: A096619 A003377 A065593 this_sequence A132505 A051618 A093470

Adjacent sequences: A089831 A089832 A089833 this_sequence A089835 A089836 A089837

KEYWORD

nonn

AUTHOR

Antti Karttunen (His_Firstname.His_Surname(AT)iki.fi), Dec 05 2003

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research