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 A220235 #11 Dec 26 2023 23:42:45
%S A220235 0,1,2,1,0,1,5,1,8,3,5,1,5,13,5,1,5,1,5,17,14,13,5,1,0,13,26,13,5,13,
%T A220235 5,1,2,13,30,1,5,13,35,17,5,37,5,9,35,13,5,1,12,23,35,45,5,1,0,41,35,
%U A220235 13,5,37,5,13,35,1,15,1,5,29,35,13,5,1,5,13,50
%N A220235 a(n) = (2^n + 3^n) modulo n.
%C A220235 a(n) = (A015910(n) + A066601(n)) mod n.
%C A220235 a(n) = 0 at n = 1, 5, 25, 55, 125, 275, 605, 625, ... (A045576).
%H A220235 Zak Seidov, <a href="/A220235/b220235.txt">Table of n, a(n) for n = 1..1000</a>
%t A220235 Table[Mod[2^n + 3^n, n],{n,100}]
%Y A220235 Cf. A015910 (2^n mod n), A066601 (3^n mod n), A045576 (n|(2^n + 3^n)).
%K A220235 nonn
%O A220235 1,3
%A A220235 _Zak Seidov_, Dec 08 2012