The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A241915 After a(1)=1, numbers 1 .. A061395(n), followed by numbers 1 .. A061395(n+1), etc. 4

%I

%S 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,

%T 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,

%U 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

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

%H Antti Karttunen, <a href="/A241915/b241915.txt">Table of n, a(n) for n = 1..10082</a>

%F a(1)=1, a(n) = n - A203623(A241920(n)-1) - 1.

%e Viewed as an irregular table, the sequence is constructed as:

%e "Row"

%e [1] 1; (by convention, a(1)=1)

%e [2] 1; (because A061395(2)=1 (the index of the largest prime factor), we have here terms from 1 to 1)

%e [3] 1, 2; (because A061395(3)=2, we have terms from 1 to 2)

%e [4] 1;

%e [5] 1, 2, 3; (because A061395(5)=3, we have terms from 1 to 3)

%e [6] 1, 2; (because A061395(6)=2, we have terms from 1 to 2)

%e [7] 1, 2, 3, 4; (because A061395(7)=4, we have terms from 1 to 4)

%e etc.

%o (Scheme)

%o (define (A241915 n) (if (= n 1) 1 (- n (A203623 (- (A241920 n) 1)) 1)))

%Y One more than A241914.

%Y Cf. A203623, A241920, A241911.

%K nonn,tabf

%O 1,4

%A _Antti Karttunen_, May 01 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 14 08:08 EDT 2020. Contains 336480 sequences. (Running on oeis4.)