Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082535
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082535 Difference between A000294 and the number of solid partitions of n (A000293). +0
4
0, 0, 0, 0, 0, 0, 1, 3, 8, 19, 40, 83, 176, 365, 775, 1643, 3483, 7299, 15170, 31010, 62563, 124221, 243296, 469856, 896491, 1690475, 3155551, 5834871, 10701036, 19479021, 35227889 (list; graph; listen)
OFFSET

0,8

COMMENT

Understanding this sequence is a famous unsolved problem.

CROSSREFS

a(n) = A000294(n) - A000293(n).

Sequence in context: A055341 A007326 A067332 this_sequence A136396 A006380 A095846

Adjacent sequences: A082532 A082533 A082534 this_sequence A082536 A082537 A082538

KEYWORD

nonn

AUTHOR

njas, based on a suggestion of John McKay, May 02 2003

EXTENSIONS

a(24) corrected by Ralf Stephan, May 05 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research