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.

A104365 a(n) = A104350(n) + 1.

This page as a plain text file.
%I A104365 #13 Apr 08 2024 01:31:06
%S A104365 2,3,7,13,61,181,1261,2521,7561,37801,415801,1247401,16216201,
%T A104365 113513401,567567001,1135134001,19297278001,57891834001,1099944846001,
%U A104365 5499724230001,38498069610001,423478765710001,9740011611330001
%N A104365 a(n) = A104350(n) + 1.
%H A104365 Reinhard Zumkeller, <a href="/A104350/a104350.txt">Products of largest prime factors of numbers <= n</a>.
%F A104365 a(n) = (a(n-1) - 1) * A006530(n) + 1 for n>1, a(1) = 0;
%t A104365 FoldList[Times, Array[FactorInteger[#][[-1, 1]] &, 30]] + 1 (* _Amiram Eldar_, Apr 08 2024 *)
%Y A104365 Cf. A006530, A006862, A038507, A104366, A104367, A104368, A104369, A104370, A104371, A104357.
%K A104365 nonn
%O A104365 1,1
%A A104365 _Reinhard Zumkeller_, Mar 06 2005