Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087076
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087076 Sums of the squares of the elements in the subsets of the integers 1 to n. +0
3
0, 1, 10, 56, 240, 880, 2912, 8960, 26112, 72960, 197120, 518144, 1331200, 3354624, 8314880, 20316160, 49020928, 116981760, 276430848, 647495680, 1504706560, 3471835136, 7958691840, 18136170496, 41104179200, 92694118400, 208071032832 (list; graph; listen)
OFFSET

0,3

COMMENT

A000076 gives the number of subsets of 1 to n. A001787 gives the number of elements in the subsets. A001788 gives the sum of the elements.

FORMULA

a(n) = (2^(n-2))*n*(n+1)*(2*n+1)/3.

G.f.: x(1+2x)/(1-2x)^4.

EXAMPLE

a(3)=56 since the subsets of (1,2,3) are ( ) (1) (1,2) (1,3) (1,2,3) (2) (2,3) (3) and the sum of the squares of the elements in these subsets is 56.

CROSSREFS

Cf. A058645 has the same then similar initial values.

Equals A014483 shifted right.

Sequence in context: A002889 A055911 A014483 this_sequence A116971 A034195 A067250

Adjacent sequences: A087073 A087074 A087075 this_sequence A087077 A087078 A087079

KEYWORD

base,easy,nonn

AUTHOR

Alan Sutcliffe (alansut(AT)ntlworld.com), Aug 08 2003

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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research