Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130650
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130650 a(n) = smallest k such that A014612(n+1) = A014612(n) + (A014612(n) mod k), or 0 if no such k exists. +0
7
0, 0, 4, 13, 2, 13, 18, 4, 43, 8, 3, 41, 4, 4, 3, 13, 2, 37, 16, 43, 97, 4, 9, 10, 53, 4, 5, 10, 3, 6, 61, 43, 2, 11, 2, 12, 163, 8, 13, 2, 5, 173, 8, 89, 4, 3, 37, 61, 101, 101, 107, 229, 113 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n) is the weight of 3-almost primes. 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 A014612(n) = 8, A014612(n+1) = 12; there is no k such that 12 - 8 = 4 = (8 mod k), hence a(1) = 0.

For n = 3 we have A014612(n) = 18, A014612(n+1) = 20; 4 is the smallest k such that 20 - 18 = 2 = (18 mod k), hence a(3) = 4.

For n = 21 we have A014612(n) = 98, A014612(n+1) = 99; 97 is the smallest k such that 99 - 98 = 1 = (97 mod k), hence a(21) = 97.

CROSSREFS

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

Sequence in context: A024248 A130539 A156823 this_sequence A051432 A046737 A046738

Adjacent sequences: A130647 A130648 A130649 this_sequence A130651 A130652 A130653

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research