cp's OEIS Frontend

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

%I A241914 #9 May 15 2014 10:21:00
%S A241914 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 A241914 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 A241914 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 A241914 After a(1)=0, numbers 0 .. A061395(n)-1, followed by numbers 0 .. A061395(n+1)-1, etc.
%H A241914 Antti Karttunen, <a href="/A241914/b241914.txt">Table of n, a(n) for n = 1..10082</a>
%F A241914 a(1)=0, a(n) = n - A203623(A241920(n)-1) - 2.
%e A241914 Viewed as an irregular table, the sequence is constructed as:
%e A241914 "Row"
%e A241914   [1] 0; (by convention, a(1)=0)
%e A241914   [2] 0; (because A061395(2)=1 (the index of the largest prime factor), we have here terms from 0 to 1-1)
%e A241914   [3] 0, 1; (because A061395(3)=2, we have terms from 0 to 2-1)
%e A241914   [4] 0;
%e A241914   [5] 0, 1, 2; (because A061395(5)=3, we have terms from 0 to 3-1)
%e A241914   [6] 0, 1;    (because A061395(6)=2, we have terms from 0 to 2-1)
%e A241914   [7] 0, 1, 2, 3; (because A061395(7)=4, we have terms from 0 to 4-1)
%e A241914 etc.
%o A241914 (Scheme)
%o A241914 (define (A241914 n) (if (= n 1) 0 (- n (+ 2 (A203623 (- (A241920 n) 1))))))
%Y A241914 One less than A241915.
%Y A241914 Cf. A203623, A241920, A241910, A241918.
%K A241914 nonn,tabf
%O A241914 1,8
%A A241914 _Antti Karttunen_, May 01 2014