Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A033550
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A033550 A005248(n)-n. +0
1
2, 2, 5, 15, 43, 118, 316, 836, 2199, 5769, 15117, 39592, 103670, 271430, 710633, 1860483, 4870831, 12752026, 33385264, 87403784, 228826107, 599074557, 1568397585, 4106118220, 10749957098, 28143753098, 73681302221, 192900153591 (list; graph; listen)
OFFSET

0,1

COMMENT

Also distinct compositions of the wheel graph W_n. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jan 02 2003

LINKS

A. Knopfmacher, M.E. Mays, Graph Compositions. I: Basic Enumeration, Integers 1(2001), #A04.

FORMULA

a(n)=3a(n-1)-a(n-2)+n-1. G.f.: (2-8x+11x^2-4x^3)/((1-3x+x^2)(1-x)^2).

a(n)=[3/2+(1/2)*sqrt(5)]^n-n+[3/2-(1/2)*sqrt(5)]^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 12 2008

PROGRAM

(PARI) a(n)=fibonacci(2*n+1)+fibonacci(2*n-1)-n

CROSSREFS

Sequence in context: A112709 A098888 A089848 this_sequence A032130 A019099 A103890

Adjacent sequences: A033547 A033548 A033549 this_sequence A033551 A033552 A033553

KEYWORD

nonn,easy

AUTHOR

njas

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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research