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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006898 a(n) = Sum_{k=0..n} C(n,k)*2^(k*(k+1)/2).
(Formerly M2958)
2
1, 3, 13, 95, 1337, 38619, 2310533, 283841911, 70927591153, 35812691480115, 36383765777442685, 74185239630793429775, 303119284294591169426729, 2479814853198140771706795531, 40599509058360322571947638063605 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Number of hierarchical quadratic models on n factors (first differences of A006896).

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

PROG

(PARI) a(n)=sum(k=0, n, binomial(n, k)*2^(k*(k+1)/2)) - Paul D. Hanna (pauldhanna(AT)juno.com), Apr 10 2009

CROSSREFS

Cf. A006896, A135748.

Sequence in context: A034513 A098462 A183283 * A129375 A085023 A144276

Adjacent sequences:  A006895 A006896 A006897 * A006899 A006900 A006901

KEYWORD

nonn

AUTHOR

C. L. Mallows (colinm(AT)research.avayalabs.com)

EXTENSIONS

Formula and more terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 20 2003

Edited by N. J. A. Sloane, Apr 12 2009 at the suggestion of Vladeta Jovovic

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 17 00:09 EST 2012. Contains 205978 sequences.