Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110030
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110030 Number of consecutive integers starting with n needed to sum to a Niven number. +0
3
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; listen)
OFFSET

1,11

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.

Adjacent sequences: A110027 A110028 A110029 this_sequence A110031 A110032 A110033

Sequence in context: A029279 A026181 A106601 this_sequence A021766 A135564 A110063

KEYWORD

base,easy,nonn

AUTHOR

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

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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research