Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130533
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130533 a(n) = smallest k such that A001358(n+1) = A001358(n) + (A001358(n) mod k), or 0 if no such k exists. +0
7
0, 0, 2, 6, 13, 9, 2, 19, 2, 19, 2, 3, 4, 37, 8, 43, 47, 47, 53, 2, 6, 59, 61, 8, 71, 6, 79, 2, 5, 83, 89, 2, 3, 12, 101, 107, 4, 3, 3, 2, 11 (list; graph; listen)
OFFSET

1,3

COMMENT

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

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

For n = 19 we have A001358(n) = 55, A001358(n+1) = 57; 53 is the smallest k such that 57 - 55 = 2 = (55 mod k), hence a(19) = 53.

CROSSREFS

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

Sequence in context: A089415 A161324 A116534 this_sequence A082722 A030416 A006284

Adjacent sequences: A130530 A130531 A130532 this_sequence A130534 A130535 A130536

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research