A205124 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A205124

Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)= j*(2^(j-1)).

4, 12, 4, 12, 32, 80, 32, 12, 192, 32, 12, 80, 448, 32, 192, 80, 80, 192, 80, 32, 5120, 1024, 448, 80, 2304, 448, 11264, 32, 2304, 192, 32, 192, 1024, 80, 5120, 192, 448, 80, 11264, 192, 53248, 5120, 524288, 1024, 192, 448, 192, 80, 2304, 2304

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

For a guide to related sequences, see A204892.

LINKS

Table of n, a(n) for n=1..50.

MATHEMATICA

(See the program at A205122.)

CROSSREFS

Cf. A205122, A204892.

Sequence in context: A308518 A307874 A230057 * A224512 A010296 A084351

Adjacent sequences: A205121 A205122 A205123 * A205125 A205126 A205127

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 25 2012

STATUS

approved