Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130882
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130882 a(n) = smallest k such that A002808(n+1) = A002808(n) + (A002808(n) mod k), or 0 if no such k exists. +0
5
0, 4, 7, 2, 4, 5, 13, 2, 7, 4, 19, 2, 4, 23, 2, 5, 2, 13, 4, 31, 2, 3, 2, 17, 37, 2, 19, 4, 43, 2, 4, 47, 2, 7, 2, 5, 53, 2, 5, 2, 4, 29, 61, 2, 3, 2, 4, 67, 2, 4, 5, 73, 2, 3, 2, 4, 79, 2, 4, 83, 2, 5, 2, 43, 89, 2, 7, 2, 3, 2, 47, 97 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) is the weight of composite 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 A002808(n) = 4, A002808(n+1) = 6; there is no k such that 6 - 4 = 2 = (4 mod k), hence a(1) = 0.

For n = 3 we have A002808(n) = 8, A002808(n+1) = 9; 7 is the smallest k such that 9 - 8 = 1 = (8 mod k), hence a(3) = 7.

For n = 24 we have A002808(n) = 36, A002808(n+1) = 38; 17 is the smallest k such that 38 - 36 = 2 = (36 mod k), hence a(24) = 17.

CROSSREFS

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

Sequence in context: A133390 A011351 A132026 this_sequence A113963 A071932 A139348

Adjacent sequences: A130879 A130880 A130881 this_sequence A130883 A130884 A130885

KEYWORD

nonn

AUTHOR

Remi Eismann (reismann(AT)free.fr), Aug 21 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research