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.

A264898 Numbers m such that A155043(n+1) = A155043(n).

This page as a plain text file.
%I A264898 #10 Dec 10 2017 04:58:54
%S A264898 1,3,8,9,15,24,25,49,63,81,85,121,195,229,255,361,440,442,446,451,483,
%T A264898 528,676,729,841,1091,1295,1443,1681,1935,2026,2115,2401,2409,2613,
%U A264898 2703,3363,3481,3721,3729,3843,3981,3985,3986,3987,4005,4107,4624,4760,4768
%N A264898 Numbers m such that A155043(n+1) = A155043(n).
%C A264898 A264893(a(n)) = 0.
%H A264898 Reinhard Zumkeller, <a href="/A264898/b264898.txt">Table of n, a(n) for n = 1..500</a>
%t A264898 Position[Differences@ Fold[Append[#1, 1 + #1[[#2 - DivisorSigma[0, #2] + 1]] ] &, {0}, Range[10^4]], 0][[All, 1]] - 1 (* _Michael De Vlieger_, Dec 09 2017 *)
%o A264898 (Haskell)
%o A264898 a264898 n = a264898_list !! (n-1)
%o A264898 a264898_list = filter ((== 0) . a264893) [0..]
%Y A264898 Cf. A264893, A155043.
%K A264898 nonn
%O A264898 1,2
%A A264898 _Reinhard Zumkeller_, Nov 27 2015