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.

A101034 Numbers n such that A002113(n) is a triangular number.

This page as a plain text file.
%I A101034 #10 Jun 17 2022 17:05:25
%S A101034 0,1,3,6,14,15,26,68,75,129,158,186,249,759,1616,1827,2268,2679,4543,
%T A101034 6072,6675,7294,13512,16146,27871,112640,116339,152889,161727,239533,
%U A101034 260487,404161,670038,685744,767718,973504,2313206,6250177,6977617
%N A101034 Numbers n such that A002113(n) is a triangular number.
%C A101034 Indices of triangular numbers in the sequence of palindromes.
%e A101034 A002113(26) = 171 is a triangular number, so 26 is a term.
%t A101034 Join[{0},Flatten[Position[Select[Range[10^7],PalindromeQ],_?(OddQ[Sqrt[ 8#+1]]&)]]] (* The program generates the first 22 terms of the sequence. *) (* _Harvey P. Dale_, Jun 17 2022 *)
%o A101034 (ARIBAS) var c,n,m:integer; end; begin c:=0; for n:=0 to 100000000 do if n = intreverse(n) then m:=floor(sqrt(2*n)); if m*(m+1) div 2 = n then write(c,","); end; inc(c); end; end; end;
%o A101034 (PARI) {c=0;for(n=0,10000000,k=n;r=0;while(k>0,d=divrem(k,10);k=d[1];r=10*r+d[2]); if(n==r,m=sqrtint(2*n);if(m*(m+1)/2==n,print1(c,","));c++))}
%Y A101034 Cf. A000217, A002113, A003098, A008509.
%K A101034 nonn,base
%O A101034 1,3
%A A101034 _Klaus Brockhaus_, Nov 27 2004
%E A101034 a(24) to a(38) from _Klaus Brockhaus_, Oct 05 2005