Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133151
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133151 a(n) = smallest k such that A000326(n+1) = A000326(n) + (A000326(n) mod k), or 0 if no such k exists. +0
1
0, 0, 0, 0, 19, 32, 24, 67, 89, 38, 71, 173, 69, 61, 71, 109, 373, 211, 79, 529, 587, 72, 89, 779, 283, 461, 499, 359, 1159, 311, 111, 1423, 1517, 269, 857, 1817, 641, 127, 134, 251, 2377, 1249, 138, 2749, 2879, 251, 787, 173, 381, 1787, 1861, 1291 (list; graph; listen)
OFFSET

1,5

COMMENT

a(n) is the weight of pentagonal numbers (A000326). 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..1000

EXAMPLE

For n = 1 we have A000326(n) = 1, A000326(n+1) = 5; there is no k such that 5 - 1 = 4 = (1 mod k), hence a(1) = 0.

For n = 5 we have A000326(n) = 35, A000326(n+1) = 51; 19 is the smallest k such that 51 - 35 = 16 = (35 mod k), hence a(5) = 19.

For n = 18 we have A000326(n) = 477, A000326(n+1) = 532; 211 is the smallest k such that 532 - 477 = 55 = (477 mod k), hence a(18) = 211.

CROSSREFS

Cf. A020639, A117078, A117563, A001223, A118534, A090369, A090368, A130533, A130650, A130703, A130889, A130882.

Sequence in context: A147210 A146816 A146659 this_sequence A101063 A061962 A116168

Adjacent sequences: A133148 A133149 A133150 this_sequence A133152 A133153 A133154

KEYWORD

nonn

AUTHOR

Remi Eismann (reismann(AT)free.fr), Sep 22 2007

page 1

Search completed in 0.006 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 December 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research