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-3 of 3 results.

A070801 Largest prime <= sigma(n): a(n) = prevprime(sigma(n)), where prevprime(n) = A007917(n), the largest prime less than or equal to n.

Original entry on oeis.org

3, 3, 7, 5, 11, 7, 13, 13, 17, 11, 23, 13, 23, 23, 31, 17, 37, 19, 41, 31, 31, 23, 59, 31, 41, 37, 53, 29, 71, 31, 61, 47, 53, 47, 89, 37, 59, 53, 89, 41, 89, 43, 83, 73, 71, 47, 113, 53, 89, 71, 97, 53, 113, 71, 113, 79, 89, 59, 167, 61, 89, 103, 127, 83, 139, 67, 113, 89
Offset: 2

Views

Author

Labos Elemer, May 08 2002

Keywords

Comments

Largest integer k such that A000203(k) <= A000203(n)+1. - Antti Karttunen, Nov 07 2017, after Benoit Cloitre's Mar 17 2002 comment in A007917.

Examples

			For n=100: sigma(100) = 217, prevprime(217) = 211 = a(100).
		

Crossrefs

Programs

  • Mathematica
    Table[Prime[PrimePi[DivisorSigma[1, w]]], {w, 2, 128}]
    Table[NextPrime[DivisorSigma[1, n] + 1, -1], {n, 2, 128}] (* Amiram Eldar, Mar 01 2024 *)
  • PARI
    A070801(n) = precprime(sigma(n)); \\ Antti Karttunen, Nov 07 2017
    
  • Scheme
    (define (A070801 n) (let ((s1 (+ 1 (A000203 n)))) (let loop ((k s1)) (if (<= (A000203 k) s1) k (loop (- k 1)))))) ;; (For code of A000203, see under that entry). Antti Karttunen, Nov 07 2017

Formula

a(n) = A000040(A000720(sigma(n))) = A007917(A000203(n)).
From Reinhard Zumkeller, Jun 26 2003: (Start)
A085379(n) <= a(n).
a(A085380(n)) = A085379(A085380(n)).
a(A085381(n)) > A085379(A085381(n)).
a(A023194(n)) = A000203(A023194(n)). (End)

A085379 Greatest prime as sum of distinct divisors of n.

Original entry on oeis.org

3, 3, 7, 5, 11, 7, 13, 13, 17, 11, 23, 13, 23, 23, 31, 17, 37, 19, 41, 31, 23, 23, 59, 31, 41, 37, 53, 29, 71, 31, 61, 47, 53, 47, 89, 37, 59, 53, 89, 41, 89, 43, 83, 73, 71, 47, 113, 7, 83, 71, 97, 53, 113, 71, 113, 79, 89, 59, 167, 61, 31, 103, 127, 83, 139, 67
Offset: 2

Views

Author

Reinhard Zumkeller, Jun 26 2003

Keywords

Examples

			The divisors of n = 50 are {1,2,5,10,25,50}, the sums of distinct divisors that are prime: 2, 3 = 2+1, 5, 7 = 5+2, 11 = 10+1, 13 = 10+2+1, 17 = 10+5+2, 31 = 25+5+1, 37 = 25+10+2, 41 = 25+10+5+1, 43 = 25+10+5+2+1, 53 = 50+2+1, 61 = 50+10+1, 67 = 50+10+5+2 and 83 = 50+25+5+2+1. Therefore a(50) = 83 < 89 = A070801(50) and A085381(3) = 50.
		

Crossrefs

Programs

Formula

a(n) <= A070801(n) <= A000203(n).
a(A085380(n)) = A070801(A085380(n)).
a(A085381(n)) < A070801(A085381(n)).
a(A023194(n)) = A000203(A023194(n)) = A062700(n).

A085381 Numbers k such that (greatest prime as sum of distinct divisors of k) < (greatest prime not greater sum of divisors of k).

Original entry on oeis.org

22, 49, 50, 62, 68, 69, 75, 81, 82, 87, 91, 94, 95, 98, 99, 106, 116, 119, 121, 122, 133, 134, 142, 146, 154, 159, 169, 182, 183, 187, 202, 213, 214, 217, 218, 225, 226, 243, 247, 249, 253, 259, 262, 265, 268, 273, 274, 279, 287, 292, 299, 301, 302, 303
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 26 2003

Keywords

Crossrefs

Complement of A085380.

Formula

A085379(a(n)) < A070801(a(n)).
Showing 1-3 of 3 results.