Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030236
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030236 Cycle-path coverings of a family of digraphs. +0
2
1, 2, 7, 18, 49, 136, 377, 1044, 2891, 8006, 22171, 61398, 170029, 470860, 1303949, 3611016, 9999959, 27692810, 76689487, 212375610, 588130153, 1628704336, 4510358465, 12490501212, 34589849507, 95789405774, 265268869027 (list; graph; listen)
OFFSET

0,2

REFERENCES

O. M. D'Antona and E. Munarini, The Cycle-path Indicator Polynomial of a Digraph, Advances in Applied Mathematics 25 (2000), 41-56.

FORMULA

a(n+4) = 3 a(n+3) - a(n+2) + a(n+1), n >= 0; a(n+3) = 2*a(n+2) + a(n+1) + 2*sum( a(i), i = 0..n ), n >= 0; G.f.: (1-t+2*t^2-2*t^3)/(1-3*t+t^2-t^3)

CROSSREFS

Cf. A030186.

Sequence in context: A072338 A022726 A017925 this_sequence A074141 A122931 A094976

Adjacent sequences: A030233 A030234 A030235 this_sequence A030237 A030238 A030239

KEYWORD

nonn,easy

AUTHOR

Ottavio D'Antona (dantona(AT)dsi.unimi.it) and Emanuele Munarini (munarini(AT)mate.polimi.it).

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 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research