cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A073933 Number of terms in n-th row of triangle in A073932.

This page as a plain text file.
%I A073933 #13 Aug 23 2017 09:48:47
%S A073933 1,2,3,3,4,4,5,4,5,5,6,5,6,6,6,5,6,6,7,6,7,7,8,6,7,7,7,7,8,7,8,6,8,7,
%T A073933 8,7,8,8,8,7,8,8,9,8,8,9,10,7,9,8,8,8,9,8,9,8,9,9,10,8,9,9,9,7,9,9,10,
%U A073933 8,10,9,10,8,9,9,9,9,10,9,10,8,9,9,10,9,9,10,10,9,10,9,10,10,10,11,10,8
%N A073933 Number of terms in n-th row of triangle in A073932.
%H A073933 Antti Karttunen, <a href="/A073933/b073933.txt">Table of n, a(n) for n = 1..10000</a>
%F A073933 From _Antti Karttunen_, Aug 23 2017: (Start)
%F A073933 a(1) = 1; for n > 1, a(n) = 1 + a(A060681(n)).
%F A073933 a(n) = 1 + A064097(n).
%F A073933 (End)
%p A073933 a[1] := 1:for i from 2 to 500 do n := i:s := 1:while(n>1) do if isprime(n) then r := n-1: else r := n-n/ifactors(n)[2][1][1]; fi; n := r:s := s+1:od:a[i] := s:od:seq(a[k],k=1..500);
%o A073933 (Scheme)
%o A073933 (define (A073933 n) (if (= 1 n) n (+ 1 (A073933 (A060681 n)))))
%o A073933 (define (A060681 n) (- n (A032742 n))) ;; See also code under A032742
%o A073933 ;; _Antti Karttunen_, Aug 23 2017
%Y A073933 Cf. A032742, A060681, A073932, A073934, A073935.
%Y A073933 One more than A064097.
%K A073933 nonn
%O A073933 1,2
%A A073933 _Amarnath Murthy_, Aug 19 2002
%E A073933 More terms from _Sascha Kurz_, Aug 23 2002
%E A073933 Offset corrected from 0 to 1 by _Antti Karttunen_, Aug 23 2017