This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133150 a(n) = smallest k such that A000290(n+1) = A000290(n) + (A000290(n) mod k), or 0 if no such k exists. 3
 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; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS a(n) is the "weight" of squares (A000290). The decomposition of squares into weight * level + gap is A000217(n) = a(n) * A184221(n) + A005408(n) if a(n) > 0. 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: A305729 A167332 A291160 * A005734 A003694 A217837 Adjacent sequences:  A133147 A133148 A133149 * A133151 A133152 A133153 KEYWORD nonn AUTHOR Rémi Eismann, Sep 22 2007 - Jan 10 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 20 12:47 EDT 2019. Contains 328257 sequences. (Running on oeis4.)