Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110029
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110029 a(n) is the minimal c >= n such that the sum of consecutive integers from n to c is a Niven number. +0
3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 12, 14, 16, 17, 19, 19, 18, 21, 20, 21, 23, 25, 24, 29, 28, 27, 32, 31, 30, 32, 37, 35, 38, 37, 36, 39, 40, 41, 40, 43, 42, 45, 46, 45, 49, 49, 48, 51, 50, 53, 56, 55, 54, 56, 58, 60, 59, 61, 60, 65, 66, 63, 66, 67, 67, 68, 70, 71, 70, 73, 72 (list; graph; listen)
OFFSET

1,2

EXAMPLE

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

CROSSREFS

Cf. A005349, A110030, A110031.

Sequence in context: A033621 A108548 A057889 this_sequence A023779 A050724 A161979

Adjacent sequences: A110026 A110027 A110028 this_sequence A110030 A110031 A110032

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research