A339146 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A339146

a(n) = a(floor(n / 5)) * (n mod 5 + 1); initial terms are 1.

1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 2, 4, 6, 8, 10, 3, 6, 9, 12, 15, 4, 8, 12, 16, 20, 5, 10, 15, 20, 25, 1, 2, 3, 4, 5, 2, 4, 6, 8, 10, 3, 6, 9, 12, 15, 4, 8, 12, 16, 20, 5, 10, 15, 20, 25, 1, 2, 3, 4, 5, 2, 4, 6, 8, 10, 3, 6, 9, 12, 15, 4, 8, 12, 16, 20, 5, 10, 15, 20, 25

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

OFFSET

0,7

COMMENTS

If a(n) is arranged in a table with row lengths 5, then the first column is the transpose of the first row, followed the transpose of the second row, followed by the transpose of the third row, and so on. The remainder of each row (except the first) is an arithmetic progression whose start and step size equals the first entry of the row.

a(n) = O(n).

limsup_n a(n) = +oo.

LINKS

Table of n, a(n) for n=0..99.

EXAMPLE

a(10) = a(2) * 1 = 1.

a(13) = a(2) * 4 = 4.

PROG

(Python)

def a(n):

if n < 5:

return 1