A238191 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A238191

Digital root of the number of partitions of n.

1, 1, 2, 3, 5, 7, 2, 6, 4, 3, 6, 2, 5, 2, 9, 5, 6, 9, 7, 4, 6, 9, 3, 4, 9, 5, 6, 4, 1, 2, 6, 2, 6, 9, 7, 6, 4, 1, 5, 9, 6, 6, 2, 9, 7, 7, 6, 5, 6, 5, 7, 3, 6, 9, 1, 7, 8, 3, 8, 4, 2, 6, 7, 6, 4, 5, 8, 2, 6, 2, 6, 6, 1, 7, 2, 3, 2, 7, 2, 8, 9, 7, 7, 2, 5, 5, 7

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

Most digital roots of sequences (barring exceptions such as digital roots of primes) produce a repeating sequence of integers. However, I do not see one in this case - yet.

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

FORMULA

a(n) = A010888(A000041(n)). - Michel Marcus, Feb 20 2014

MATHEMATICA

Table[NestWhile[Total[IntegerDigits[#]]&, PartitionsP[n], #>9&], {n, 0, 90}] (* Harvey P. Dale, Aug 04 2024 *)

CROSSREFS

Cf. A000041, A010888.

Sequence in context: A078400 A068951 A139752 * A004088 A126051 A115260

Adjacent sequences: A238188 A238189 A238190 * A238192 A238193 A238194

KEYWORD

nonn,base

AUTHOR

Suman Vaze, Feb 19 2014

EXTENSIONS

More terms from Michel Marcus, Feb 20 2014

STATUS

approved