login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027992 a(n) = 1*T(n,0) + 2*T(n,1) + ... + (2n+1)*T(n,2n), T given by A027926. 3
1, 6, 22, 66, 178, 450, 1090, 2562, 5890, 13314, 29698, 65538, 143362, 311298, 671746, 1441794, 3080194, 6553602, 13893634, 29360130, 61865986, 130023426, 272629762, 570425346, 1191182338, 2483027970, 5167382530, 10737418242 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Also total sum of squares of parts in all compositions of n (offset 1). Total sum of cubes of parts in all compositions of n is (13*n-36)*2^(n-1)+6*n+18; total sum of fourth powers of parts in all compositions of n is (75*n-316)*2^(n-1)+12*n^2+72*n+158; total sum of fifth powers of parts in all compositions of n is (541*n-3060)*2^(n-1)+20*n^3+180*n^2+790*n+1530. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 18 2005

REFERENCES

Alejandro Erickson and Mark Schurch, Monomer-dimer tatami tilings of square regions, Arxiv preprint arXiv:1110.5103, 2011

Alejandro Erickson and Mark Schurch, Enumerating tatami mat arrangements of square grids, in 22nd International Workshop on Combinatorial Algorithms, University of Victoria, June 20-22, volume 7056 of Lecture Notes in Computer Science (LNCS), Springer Berlin / Heidelberg, 2011, pp. 223-235, DOI: 10.1007/978-3-642-25011-8_18

FORMULA

Conjectures: a(n) = 2^n*(3n-1)+2 = A048496(n+1)-1 = A053565(n+1)+2. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Jan 15 2004

CROSSREFS

Cf. A066183.

Sequence in context: A099855 A003469 A189418 * A171495 A178706 A159555

Adjacent sequences:  A027989 A027990 A027991 * A027993 A027994 A027995

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.