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.
%I A152569 #3 Jul 22 2020 11:42:35
%S A152569 30,45,54,66,78,93,97,113,118,135,142,143,163,171,195,205,211,235,247,
%T A152569 278,297,310,339,355,379,401,429,432,455,490,510,519,524,548,555,578,
%U A152569 618,627,640,646,654,658,668,734,746,759,790,797,834,846,852,875,890
%N A152569 Terms in A005229 occurring exactly 3 times.
%t A152569 aa[1] = aa[2] = 1; aa[n_] := aa[n] = aa[aa[n - 2]] + aa[n - aa[n - 2]]; ta2000 = Table[aa[n], {n, 2000}]; re3 = Reap[Do[If[Count[ta2000, k] == 3, Sow[k]], {k, 1379}]][[2, 1]]
%Y A152569 A005229 a(1)=a(2)=1; for n>2, a(n)=a(a(n-2))+a(n-a(n-2)).
%K A152569 nonn
%O A152569 1,1
%A A152569 _Zak Seidov_, Dec 08 2008