login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #9 May 15 2014 10:21:00

%S 0,0,0,1,0,0,1,2,0,1,0,1,2,3,0,0,1,0,1,2,0,1,2,3,4,0,1,0,1,2,3,4,5,0,

%T 1,2,3,0,1,2,0,0,1,2,3,4,5,6,0,1,0,1,2,3,4,5,6,7,0,1,2,0,1,2,3,0,1,2,

%U 3,4,0,1,2,3,4,5,6,7,8,0,1,0,1,2,0,1,2,3,4,5,0,1,0,1,2,3,0,1,2,3,4,5,6,7,8,9,0,1,2,0,1,2,3,4,5,6,7,8,9,10,0

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

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

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

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

%e "Row"

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

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

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

%e [4] 0;

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

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

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

%e etc.

%o (Scheme)

%o (define (A241914 n) (if (= n 1) 0 (- n (+ 2 (A203623 (- (A241920 n) 1))))))

%Y One less than A241915.

%Y Cf. A203623, A241920, A241910, A241918.

%K nonn,tabf

%O 1,8

%A _Antti Karttunen_, May 01 2014