login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184829 a(n) = smallest k such that A000961(n+1) = A000961(n) + (A000961(n) mod k), or 0 if no such k exists. 3
0, 0, 2, 3, 3, 2, 7, 7, 3, 5, 3, 3, 5, 3, 23, 5, 3, 2, 9, 11, 3, 13, 3, 5, 47, 3, 29, 61, 7, 3, 67, 7, 79, 7, 9, 31, 3, 9, 3, 5, 15, 9, 3, 2, 5, 25, 3, 43, 3, 29, 151, 53, 3, 5, 167, 3, 19, 3, 7, 3, 17, 199, 73, 3, 5, 227, 3, 239, 47, 6, 3, 251, 257, 3, 53, 7, 3, 277, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n) is the "weight" of prime powers.

The decomposition of prime powers into weight * level + gap is A000961(n) = a(n) * A184831(n) + A057820(n) if a(n) > 0.

LINKS

Rémi Eismann, Table of n, a(n) for n = 1..10000

EXAMPLE

For n = 1 we have A000961(1) = 1, A000961(2) = 2; there is no k such that 2 - 1 = 1 = (1 mod k), hence a(1) = 0.

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

For n = 24 we have A000961(24) = 49, A000961(25) = 53; 5 is the smallest k such that 53 - 49 = 4 = 49 mod k), hence a(24) = 5.

CROSSREFS

Cf. A000961, A057820, A184831, A184830, A117078, A117563, A001223, A118534.

Sequence in context: A238114 A023139 A175393 * A153290 A153516 A153311

Adjacent sequences:  A184826 A184827 A184828 * A184830 A184831 A184832

KEYWORD

nonn

AUTHOR

Rémi Eismann, Jan 23 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 26 22:38 EDT 2017. Contains 289840 sequences.