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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114096 Number of partitions of n into parts that are distinct mod 8. 0
1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 12, 13, 16, 20, 23, 26, 31, 37, 42, 47, 54, 65, 72, 80, 90, 108, 115, 129, 145, 168, 184, 200, 220, 259, 270, 301, 336, 375, 411, 436, 477, 546, 568, 631, 700, 755, 832, 862, 945, 1050 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..50.

EXAMPLE

a(7)=5 because there are 5 such partition of 7: {7}, {1,6}, {2,5}, {3,4}, {4,2,1}.

MATHEMATICA

<< DiscreteMath`Combinatorica`; np[n_]:= Length@Select[Mod[ #, 8]& /@ Partitions[n], (Length@# != Length@Union@#)&]; lst = Array[np, 50]

CROSSREFS

Sequence in context: A153156 A017852 A029013 * A008582 A069911 A185225

Adjacent sequences:  A114093 A114094 A114095 * A114097 A114098 A114099

KEYWORD

nonn

AUTHOR

Giovanni Resta, Feb 06 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 12:25 EST 2016. Contains 278971 sequences.