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 A046036 #30 Aug 28 2025 19:40:08
%S A046036 2,10,16,34,49,2570
%N A046036 Indices of the concatenation of the first k odd numbers (A019519) which are primes.
%C A046036 No others with k <= 12000. - _Eric W. Weisstein_, Mar 01 2004
%C A046036 No others with k <= 25000. - _Michael S. Branicky_, Aug 28 2025
%H A046036 H. Ibstedt, <a href="https://www.gallup.unm.edu/~smarandache/SN/SIntegerSeq.pdf">A Few Smarandache Integer Sequences</a>, Smarandache Notions Journal, Vol. 8, No. 1-2-3, 1997, pp. 171-183.
%H A046036 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ConsecutiveNumberSequences.html">Consecutive Number Sequences</a>
%H A046036 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IntegerSequencePrimes.html">Integer Sequence Primes</a>
%H A046036 <a href="/index/Mo#MWP">Index entries for sequences related to Most Wanted Primes video</a>
%F A046036 a(n) = (A066811(n)+1)/2. - _Michel Marcus_, Jan 31 2014
%t A046036 Module[{nn=50,odds},odds=Range[1,2nn+1,2];Position[Table[ FromDigits[ Flatten[IntegerDigits/@Take[odds,n]]],{n,nn}],_?(PrimeQ[#]&)]]// Flatten (* The program generates the first 5 terms of the sequence. To generate the 6th, increase the value of nn to 2570 or more, but the program will take a long time to run. *) (* _Harvey P. Dale_, Jul 21 2021 *)
%Y A046036 Cf. A019519, A048847, A066811.
%K A046036 nonn,base,more,changed
%O A046036 1,1
%A A046036 _Eric W. Weisstein_