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 A277190 #11 Oct 08 2016 17:02:24 %S A277190 25,50,55,65,77,81,91,95,100,110,115,117,121,125,130,133,143,145,147, %T A277190 154,161,162,169,171,175,182,185,189,190,200,203,205,207,209,215,220, %U A277190 230,234,235,242,243,245,247,250,253,260,265,266,275,286,289,290,294,295,299,301,305,308,319,322,323,324,325,329,333,335,338 %N A277190 Numbers n such that A277013(n) differs from A001222(n). %C A277190 If the conjecture by Ulas and Ulas is true, then there are no primes in this sequence. See A186891. %H A277190 Antti Karttunen, <a href="/A277190/b277190.txt">Table of n, a(n) for n = 1..10000</a> %H A277190 Maciej Ulas and Oliwia Ulas, <a href="http://arxiv.org/abs/1102.5109">On certain arithmetic properties of Stern polynomials</a>, arXiv:1102.5109 [math.CO], 2011. %Y A277190 Cf. A001222, A186891, A277013. %K A277190 nonn %O A277190 1,1 %A A277190 _Antti Karttunen_, Oct 07 2016