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.

A073934 Sum of terms in n-th row of triangle in A073932.

This page as a plain text file.
%I A073934 #16 Apr 15 2020 12:41:01
%S A073934 1,3,6,7,12,12,19,15,21,22,33,24,37,33,37,31,48,39,58,42,54,55,78,48,
%T A073934 67,63,66,61,90,67,98,63,88,82,96,75,112,96,102,82,123,96,139,99,112,
%U A073934 124,171,96,145,117,133,115,168,120,154,117,153,148,207,127,188,160
%N A073934 Sum of terms in n-th row of triangle in A073932.
%H A073934 Antti Karttunen, <a href="/A073934/b073934.txt">Table of n, a(n) for n = 1..10000</a>
%F A073934 a(1) = 1; for n > 1, a(n) = n + a(A060681(n)). - _Antti Karttunen_, Aug 23 2017
%p A073934 a[1] := 1:for i from 2 to 500 do n := i:s := n: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+n:od:a[i] := s:od:seq(a[k],k=1..500);
%t A073934 Array[If[# == 1, 1, Total@ NestWhileList[If[PrimeQ@ #, # - 1, # - #/FactorInteger[#][[1, 1]] ] &, #, # > 1 &]] &, 62]
%o A073934 (Scheme)
%o A073934 (define (A073934 n) (if (= 1 n) n (+ n (A073934 (A060681 n)))))
%o A073934 (define (A060681 n) (- n (A032742 n))) ;; See also code under A032742
%o A073934 ;; _Antti Karttunen_, Aug 23 2017
%Y A073934 Cf. A032742, A060681, A073932, A073933, A073935.
%K A073934 nonn
%O A073934 1,2
%A A073934 _Amarnath Murthy_, Aug 19 2002
%E A073934 More terms from _Sascha Kurz_, Aug 23 2002
%E A073934 Offset corrected from 0 to 1 by _Antti Karttunen_, Aug 23 2017