login
This site is supported by donations to The OEIS Foundation.

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110030 Number of consecutive integers starting with n needed to sum to a Niven number. 2
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: A029279 A026181 A106601 * A211948 A021766 A135564

Adjacent sequences:  A110027 A110028 A110029 * A110031 A110032 A110033

KEYWORD

base,easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 08 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified August 29 01:49 EDT 2015. Contains 261184 sequences.