Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072239
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072239 a(0) = 11; a(n) = number of distinct partitions of the previous term. +0
2
11, 12, 15, 27, 192, 299016608 (list; graph; listen)
OFFSET

0,1

COMMENT

a(0) = 11; for n >= 0, a(n+1) = A000009(a(n)).

EXAMPLE

a(4)=192 which equals the number of restricted partitions (A000009) of 27.

MATHEMATICA

NestList[PartitionsQ, 11, 5]

CROSSREFS

Cf. A000009 & A072215.

Sequence in context: A139138 A113600 A097158 this_sequence A079350 A070605 A087450

Adjacent sequences: A072236 A072237 A072238 this_sequence A072240 A072241 A072242

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 06 2002

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com) at the suggestion of Andrew Plewe, May 21 2007

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research