Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026674
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026674 a(n) = T(2n-1,n-1) = T(2n,n+1), T given by A026725. +0
4
1, 4, 16, 65, 267, 1105, 4597, 19196, 80380, 337284, 1417582, 5965622, 25130844, 105954110, 447015744, 1886996681, 7969339643, 33670068133, 142301618265, 601586916703, 2543852427847, 10759094481491, 45513214057191, 192560373660245 (list; graph; listen)
OFFSET

1,2

REFERENCES

Paul Barry, A Catalan Transform and Related Transformations on Integer Sequences, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.5.

LINKS

Rob Arthan, Comments on A026674, A026725, A026670

FORMULA

G.f.: 1/2*[(1-x)/(sqrt(1-4x)-x)-1] (conjectured). - Ralf Stephan, Feb 05 2004

G.f.: xc(x)^3/(1-x*c(x)^3)=(1-5x-(1-x)sqrt(1-4x))/(2(x^2+4x-1)), c(x) the g.f. of A000108; - Paul Barry (pbarry(AT)wit.ie), Mar 19 2007

CROSSREFS

Also a(n) = T(2n-1, n-1), T given by A026670.

Sequence in context: A012781 A132820 A165201 this_sequence A099781 A026872 A081915

Adjacent sequences: A026671 A026672 A026673 this_sequence A026675 A026676 A026677

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research