A110030 - 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

A110030

Number of consecutive integers starting with n needed to sum to a Niven number.

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

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

OFFSET

1,11

LINKS

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

EXAMPLE

a(25)=5 because 25 + 26 + 27 + 28 + 29 = 135 and 135/9 = 15, 5 consecutive

integers are needed.

CROSSREFS

Cf. A005349, A110029, A110031.

Sequence in context: A337566 A106601 A325533 * A211948 A021766 A286357

Adjacent sequences: A110027 A110028 A110029 * A110031 A110032 A110033

KEYWORD

base,easy,nonn

AUTHOR

Jason Earls, Jul 08 2005

STATUS

approved