

A241915


After a(1)=1, numbers 1 .. A061395(n), followed by numbers 1 .. A061395(n+1), etc.


4



1, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 2, 3, 4, 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 1, 2, 3, 1, 1, 2, 3, 4, 5, 6, 7, 1, 2, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 1, 2, 3, 1, 2, 3, 4, 5, 6, 1, 2, 1, 2, 3, 4, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


LINKS

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


FORMULA

a(1)=1, a(n) = n  A203623(A241920(n)1)  1.


EXAMPLE

Viewed as an irregular table, the sequence is constructed as:
"Row"
[1] 1; (by convention, a(1)=1)
[2] 1; (because A061395(2)=1 (the index of the largest prime factor), we have here terms from 1 to 1)
[3] 1, 2; (because A061395(3)=2, we have terms from 1 to 2)
[4] 1;
[5] 1, 2, 3; (because A061395(5)=3, we have terms from 1 to 3)
[6] 1, 2; (because A061395(6)=2, we have terms from 1 to 2)
[7] 1, 2, 3, 4; (because A061395(7)=4, we have terms from 1 to 4)
etc.


PROG

(Scheme)
(define (A241915 n) (if (= n 1) 1 ( n (A203623 ( (A241920 n) 1)) 1)))


CROSSREFS

One more than A241914.
Cf. A203623, A241920, A241911.
Sequence in context: A109671 A141289 A284271 * A301891 A177219 A277700
Adjacent sequences: A241912 A241913 A241914 * A241916 A241917 A241918


KEYWORD

nonn,tabf


AUTHOR

Antti Karttunen, May 01 2014


STATUS

approved



