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 A082742 #20 Jan 08 2018 01:47:44 %S A082742 2,4,6,8,12,14,20,22,30,32,42,44,56,58,72,74,90,92,110,112,132,134, %T A082742 156,158,182,184,210,212,240,242,272,274,306,308,342,344,380,382,420, %U A082742 422,462,464,506,508,552,554,600,602,650,652,702,704,756,758,812,814,870,872,930,932,992,994,1056,1058,1122,1124,1190,1192,1260,1262,1332,1334,1406,1408,1482,1484,1560,1562 %N A082742 Indices of occurrences of 2 in A004738. %C A082742 Indices of occurrences of 1 in A004738 are given by A002061, b(n) = n^2 - n + 1 (the central polygonal numbers). All entries are even. %H A082742 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1). %F A082742 G.f.: 2*x*(1+x-x^2-x^3+x^4)/((1+x)^2*(1-x)^3). - _Charles R Greathouse IV_, Feb 03 2013 %F A082742 a(n) = 2*A134519(n). - _R. J. Mathar_, Feb 03 2013 %p A082742 A004738 := proc(n) %p A082742 local f ; %p A082742 f := floor(sqrt(n)+1/2) ; %p A082742 f+1-abs(n-1-f^2) ; %p A082742 end proc: %p A082742 for n from 1 to 1600 do %p A082742 if A004738(n) = 2 then %p A082742 printf("%d,",n) ; %p A082742 end if; %p A082742 end do: # _R. J. Mathar_, Feb 03 2013 %t A082742 LinearRecurrence[{1,2,-2,-1,1},{2,4,6,8,12},80] (* _Harvey P. Dale_, Jun 16 2017 *) %o A082742 (PARI) a(n)=(n^2+2*n+8+if(n%2,2*n-5))/4 \\ _Charles R Greathouse IV_, Feb 03 2013 %Y A082742 Cf. A004738. %K A082742 nonn,easy %O A082742 1,1 %A A082742 _Amarnath Murthy_, Apr 15 2003 %E A082742 More terms from _R. J. Mathar_, Feb 03 2013