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.

Showing 1-4 of 4 results.

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

Original entry on oeis.org

1, 3, 6, 7, 12, 12, 19, 15, 21, 22, 33, 24, 37, 33, 37, 31, 48, 39, 58, 42, 54, 55, 78, 48, 67, 63, 66, 61, 90, 67, 98, 63, 88, 82, 96, 75, 112, 96, 102, 82, 123, 96, 139, 99, 112, 124, 171, 96, 145, 117, 133, 115, 168, 120, 154, 117, 153, 148, 207, 127, 188, 160
Offset: 1

Views

Author

Amarnath Murthy, Aug 19 2002

Keywords

Crossrefs

Programs

  • Maple
    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);
  • Mathematica
    Array[If[# == 1, 1, Total@ NestWhileList[If[PrimeQ@ #, # - 1, # - #/FactorInteger[#][[1, 1]] ] &, #, # > 1 &]] &, 62]
  • Scheme
    (define (A073934 n) (if (= 1 n) n (+ n (A073934 (A060681 n)))))
    (define (A060681 n) (- n (A032742 n))) ;; See also code under A032742
    ;; Antti Karttunen, Aug 23 2017

Formula

a(1) = 1; for n > 1, a(n) = n + a(A060681(n)). - Antti Karttunen, Aug 23 2017

Extensions

More terms from Sascha Kurz, Aug 23 2002
Offset corrected from 0 to 1 by Antti Karttunen, Aug 23 2017

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

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Amarnath Murthy, Aug 19 2002

Keywords

Crossrefs

One more than A064097.

Programs

  • Maple
    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);
  • Scheme
    (define (A073933 n) (if (= 1 n) n (+ 1 (A073933 (A060681 n)))))
    (define (A060681 n) (- n (A032742 n))) ;; See also code under A032742
    ;; Antti Karttunen, Aug 23 2017

Formula

From Antti Karttunen, Aug 23 2017: (Start)
a(1) = 1; for n > 1, a(n) = 1 + a(A060681(n)).
a(n) = 1 + A064097(n).
(End)

Extensions

More terms from Sascha Kurz, Aug 23 2002
Offset corrected from 0 to 1 by Antti Karttunen, Aug 23 2017

A073935 Numbers n such that the n-th row of triangle in A073932 contains exactly the divisors of n.

Original entry on oeis.org

1, 2, 4, 6, 8, 16, 18, 20, 32, 42, 54, 64, 100, 128, 162, 256, 272, 294, 342, 486, 500, 512, 1024, 1458, 1806, 2048, 2058, 2500, 4096, 4374, 4624, 6498, 8192, 10100, 12500, 13122, 14406, 16384, 26406, 32768, 39366, 62500, 65536, 65792, 77658
Offset: 1

Views

Author

Amarnath Murthy, Aug 19 2002

Keywords

Crossrefs

Extensions

More terms from Sascha Kurz, Aug 23 2002
Name clarified by Sean A. Irvine, Dec 28 2024

A074093 Number of values of k such that n = k - largest divisor of k (

Original entry on oeis.org

1, 2, 1, 2, 1, 3, 1, 1, 1, 3, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 1, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 3, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 1, 4, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 4, 1, 1, 1
Offset: 1

Views

Author

Amarnath Murthy, Aug 19 2002

Keywords

Examples

			a(6) = 3 and the three values of k are 7,9 and 12.
		

Crossrefs

Programs

Formula

a(2n+1)=1; sum(k=1, n, a(k)) seems to be asymptotic to C*n with C=1.6... - Benoit Cloitre, Aug 21 2002

Extensions

More terms from Benoit Cloitre and Vladeta Jovovic, Aug 21 2002
Showing 1-4 of 4 results.