A093411 - OEIS

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

A093411

Divide n by the largest factorial that divides it and repeat until an odd number is reached, which will be the result; a(0) = 0.

0, 1, 1, 3, 1, 5, 1, 7, 1, 9, 5, 11, 1, 13, 7, 15, 1, 17, 3, 19, 5, 21, 11, 23, 1, 25, 13, 27, 7, 29, 5, 31, 1, 33, 17, 35, 1, 37, 19, 39, 5, 41, 7, 43, 11, 45, 23, 47, 1, 49, 25, 51, 13, 53, 9, 55, 7, 57, 29, 59, 5, 61, 31, 63, 1, 65, 11, 67, 17, 69, 35, 71, 3, 73, 37, 75, 19, 77, 13, 79

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

OFFSET

0,4

COMMENTS

a(n) is odd for all positive n>0; a(n) = n iff n is odd.

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..40319

Index entries for sequences related to factorial numbers

FORMULA

From Antti Karttunen, May 18 2021: (Start)

a(0) = 0, a(2n+1) = 2n+1, a(2n) = a(A076934(2n)).

a(n) = n / A329379(n).