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.

A067068 a(n) = n* - 2^n, where n* (A003418) = least common multiple of the numbers [1,...,n].

This page as a plain text file.
%I A067068 #13 Sep 24 2022 13:09:33
%S A067068 -1,-2,-2,-4,28,-4,292,584,2008,1496,25672,23624,352168,343976,327592,
%T A067068 655184,12121168,11990096,232268272,231743984,230695408,228598256,
%U A067068 5345840272,5337451664,26737589968,26704035536,80179215472,80044997744
%N A067068 a(n) = n* - 2^n, where n* (A003418) = least common multiple of the numbers [1,...,n].
%C A067068 It is known that this sequence is nonnegative for n >= 7. This can be established using the methods used to show A059794 is nonnegative. - Carl Pomerance, Bell Labs, Feb 16 2002
%D A067068 Tenenbaum, G. (2015). Introduction to analytic and probabilistic number theory, 3rd ed.,  American Mathematical Soc. See Theorem 1.5.
%H A067068 Harvey P. Dale, <a href="/A067068/b067068.txt">Table of n, a(n) for n = 1..1000</a>
%t A067068 Table[LCM@@Range[n]-2^n,{n,30}] (* _Harvey P. Dale_, Sep 24 2022 *)
%Y A067068 Cf. A003418, A059794.
%K A067068 sign
%O A067068 1,2
%A A067068 _N. J. A. Sloane_, Feb 17 2002