[seqfan] Re: Counting multigraphs

franktaw at netscape.net franktaw at netscape.net
Tue Jun 21 02:01:37 CEST 2011


It appears, based on the title, values, and proximity, that this is the 
Euler
transform of A007719. This sequence is marked as hard instead of
easy, and does not have as many values as A007717.

Can anyone verify that this relationship is correct?

Assuming it is, A007719 should be extended to:
2, 4, 11, 30, 95, 328, 1211, 4779, 19902, 86682, 393072, 1847264,
8965027, 44814034, 230232789

I guess that both sequences should be marked as hard. Certainly both
should be at the same difficulty level.

Franklin T. Adams-Watters

-----Original Message-----
From: Charles Greathouse <charles.greathouse at case.edu>

A sequence defined in terms of A007717 was recently submitted, and an
editor asked if it and A007717 could be extended.  A007717 itself is
marked as an easy sequence, but I must admit that I'm not sure how to
extend it.  If it is easy, would someone add a program and more terms
(ideally a 10,000-term b-file, but the standard three lines would do
as well)?  I assume this is one of the things that is "well-known to
those who well-know it".

On the other hand, if it's not easy the keyword, at least, should be
removed (and whatever can be added should be).

Charles Greathouse
Analyst/Programmer
Case Western Reserve University
  



More information about the SeqFan mailing list