Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035685
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035685 Number of partitions of n into parts 8k+2 and 8k+3 with at least one part of each type. +0
1
0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 10, 7, 12, 11, 14, 13, 18, 15, 24, 19, 28, 27, 33, 31, 42, 36, 51, 45, 60, 58, 71, 68, 87, 79, 103, 96, 120, 118, 141, 137, 169, 159, 197, 189, 228, 226, 266, 262, 314, 302, 362, 355, 416, 416, 482, 478, 561, 550 (list; graph; listen)
OFFSET

1,11

CROSSREFS

Sequence in context: A086449 A070556 A065295 this_sequence A118736 A105474 A120988

Adjacent sequences: A035682 A035683 A035684 this_sequence A035686 A035687 A035688

KEYWORD

nonn

AUTHOR

Olivier Gerard (ogerard(AT)ext.jussieu.fr)

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research