Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130703
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130703 a(n) = smallest k such that A000217(n+1) = A000217(n) + (A000217(n) mod k), or 0 if no such k exists. +0
7
0, 0, 0, 0, 9, 14, 10, 27, 35, 22, 18, 65, 77, 18, 26, 119, 27, 38, 34, 27, 209, 46, 28, 55, 299, 36, 35, 377, 45, 62, 58, 45, 527, 40, 54, 629, 95, 54, 74, 779, 63, 86, 82, 63, 989, 94, 54, 161, 235, 68, 91, 265, 81, 65, 106, 81, 145, 118, 90, 1769, 1829 (list; graph; listen)
OFFSET

1,5

COMMENT

a(n) is the weight of triangular numbers. A020639(n) is the weight of natural numbers. A117078(n) is the weight of primes numbers.

LINKS

Remi Eismann, Table of n, a(n) for n=1..9999

EXAMPLE

For n = 1 we have A000217(n) = 1, A000217(n+1) = 3; there is no k such that 3 - 1 = 2 = (1 mod k), hence a(1) = 0.

For n = 5 we have A000217(n) = 15, A000217(n+1) = 21; 9 is the smallest k such that 21 - 15 = 6 = (15 mod k), hence a(5) = 9.

For n = 22 we have A000217(n) = 253, A000217(n+1) = 276; 46 is the smallest k such that 276 - 253 = 23 = (253 mod k), hence a(22) = 46.

CROSSREFS

Cf. A020639, A117078, A117563, A001223, A118534, A090369, A090368.

Sequence in context: A115445 A131602 A004474 this_sequence A050939 A036266 A087722

Adjacent sequences: A130700 A130701 A130702 this_sequence A130704 A130705 A130706

KEYWORD

nonn

AUTHOR

Remi Eismann (reismann(AT)free.fr), Aug 16 2007

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research