A276329 a(n) = largest k such that A001563(k) divides n.

1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2

Offset

1,4

Links

Antti Karttunen, Table of n, a(n) for n = 1..4320

Mathematica

f[n_] := Block[{a = {{0, n}}}, Do[AppendTo[a, {First@ #, Last@ #} &@ QuotientRemainder[a[[-1, -1]], (# #!) &[# - i]]], {i, 0, # - 1}] &@ NestWhile[# + 1 &, 0, (# #!) &[# + 1] <= n &]; Rest[a][[All, 1]]]; Table[Length@ TakeWhile[Reverse@ f@ n, # == 0 &] + 1, {n, 120}] (* Michael De Vlieger, Aug 31 2016 *)

Prog

(Scheme) (define (A276329 n) (let loop ((i (A258198 n))) (cond ((zero? i) 1) ((zero? (modulo n (A001563 i))) i) (else (loop (- i 1))))))

Crossrefs

Cf. A001563, A258198, A276330.

Sequence in context: A022929 A307706 A161102 * A161101 A115362 A365632

Adjacent sequences: A276326 A276327 A276328 * A276330 A276331 A276332

Keyword

nonn

Author

Antti Karttunen, Aug 30 2016

Status

approved