Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133150 a(n) = smallest k such that A000290(n+1) = A000290(n) + (A000290(n) mod k), or 0 if no such k exists. +0
1
0, 0, 0, 0, 14, 23, 17, 47, 31, 79, 49, 119, 71, 167, 97, 223, 127, 41, 46, 359, 199, 439, 241, 527, 82, 89, 337, 727, 391, 839, 449, 137, 73, 1087, 577, 1223, 647, 1367, 103, 217, 94, 1679, 881, 1847, 967, 119, 151, 2207, 1151, 2399, 1249, 113, 193, 401, 1457 (list; graph; listen)
OFFSET

1,5

COMMENT

a(n) is the weight of squares (A000290). 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..10000

EXAMPLE

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

For n = 5 we have A000290(n) = 25, A000290(n+1) = 36; 14 is the smallest k such that 36 - 25 = 11 = (25 mod k), hence a(5) = 14.

For n = 18 we have A000290(n) = 324, A000290(n+1) = 361; 41 is the smallest k such that 361 - 324 = 37 = (324 mod k), hence a(18) = 41.

CROSSREFS

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

Sequence in context: A043114 A043894 A054276 this_sequence A005734 A003694 A102876

Adjacent sequences: A133147 A133148 A133149 this_sequence A133151 A133152 A133153

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.003 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 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research