[seqfan] Re: Help needed

[Robert Munafo]

Oops, silly me. Two Richards (Mathar != Guy)

So, Richard Guy, maybe Richard Mathar wasn't trying to answer your "two (at
least) difficulties".

you wrote:

> (a) the earlier members of the sequence, 0, 1, 2, 12, 36, may not be
appropriate to the definitions in the papers.

No problem, just create multiple sequences: one for the paper, and another
for the simple "A1477(n)*A0045(n)^2" definition. They can %Y cross-reference
each other.

Your other "difficulties" look like they ought to be directed to the authors
of the papers you cited.

> MR0364002 (51 #257) Kleitman, D. J.; Golden, B. Counting trees in a
certain class of graphs.
> Amer. Math. Monthly 82 (1975), 40-44.

> MR0806296 (87c:05045) Baron, G.(A-TUWN); Prodinger, H.(A-TUWN); Tichy, R.
F.(A-TUWN);
> Boesch, F. T.(1-STIT); Wang, J. F.(RC-TAIN) The number of spanning trees
in the square of a cycle.
> Fibonacci Quart. 23 (1985), no. 3, 258-264.

On Sat, Mar 13, 2010 at 18:43, Robert Munafo <mrob27 at gmail.com> wrote:

> Richard,
>
> There were no questions in your first message.
>
> Try stating the questions explicitly.
>
> On Saturday, March 13, 2010, Richard Guy <rkg at cpsc.ucalgary.ca> wrote:
> > Glad you think so, but my questions remain unanswered.  R.
> >
> >> %I A000001
> >> %S A000001
> 0,1,2,12,36,125,384,1183,3528,10404,30250,87131,248832,705757,
> >> %T A000001
> 1989806,5581500,15586704,43356953,120187008,332134459,915304500,
> >> %U A000001
> 2516113236,6900949462,18888143927,51599794176,140718765625,383142771674
> >> %N A000001 n times the square of Fibonacci(n).
> >> ...
>
-- 
 Robert Munafo  --  mrob.com