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.

A112642 Primorial number quotients arising in A007684: a(n) = A002110(A007684(n))/A002110(n-1).

This page as a plain text file.
%I A112642 #23 Jul 27 2022 10:37:04
%S A112642 6,15015,33426748355,1357656019974967471687377449,
%T A112642 7105630242567996762185122555313528897845637444413640621,
%U A112642 1924344668948998025181489521338230544342953524990122861050411878226909135705454891961917517
%N A112642 Primorial number quotients arising in A007684: a(n) = A002110(A007684(n))/A002110(n-1).
%C A112642 These numbers are (perhaps the smallest) squarefree solutions to Puzzle 329 of Rivera; a(n) is abundant, not divisible by the first n-1 prime numbers, i.e., the least prime divisor of a(n) is the n-th prime number.
%C A112642 Duplicate of A007702.
%H A112642 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_329.htm">Puzzle 329. Odd abundant numbers not divided by 2 or 3</a>, The Prime Puzzles and Problems Connection.
%F A112642 a(n) = A002110(A007684(n))/A002110(n-1).
%e A112642 The corresponding sigma(a(n))/a(n) abundance ratios are as follows: 2, 2.14825, 2.00097, 2.01433, 2.00587, 2.00101, ...;
%e A112642 the terms have 2,3,5,7,11,... as least prime divisors.
%Y A112642 Cf. A007702, A002110, A007684, A064001, A110585, A112640.
%K A112642 nonn
%O A112642 1,1
%A A112642 _Labos Elemer_, Sep 19 2005
%E A112642 Term a(2) and name corrected by _Andrey Zabolotskiy_, Jul 16 2022