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.

A145465 a(0) = 2, a(1) = 2, and for n > 1, a(n) = a(n-1) + a((a(n-1) - 1) mod n).

This page as a plain text file.
%I A145465 #4 Jun 01 2025 18:24:44
%S A145465 2,2,4,6,8,12,24,28,34,58,86,120,240,252,504,538,596,598,604,1108,
%T A145465 1136,1138,1676,2784,5568,6166,6172,6710,7308,14616,14628,20800,41600,
%U A145465 42708,42714,42966,43564,44068,50234,50236,93202,93236
%N A145465 a(0) = 2, a(1) = 2, and for n > 1, a(n) = a(n-1) + a((a(n-1) - 1) mod n).
%K A145465 easy,nonn
%O A145465 0,1
%A A145465 _Vladimir Reshetnikov_, Oct 11 2008