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 A049476 #40 Aug 08 2021 03:50:21
%S A049476 1,2,5,13,14,26,61,63,111,131,151,153,155,161,179,295,390,391,398,425,
%T A049476 428,459,485,656,675,1142,1143,1169,1243,1247,1255,1263,1267,1639,
%U A049476 1643,1646,1748,2690,2702,2703,2728,2767,2777,2786,2840,2877
%N A049476 Positions of records in A346778.
%C A049476 Previous name: Row numbers that set records for initial gap lengths g in the permutations found in A088643.
%H A049476 J. W. Roche, <a href="http://www.jstor.org/stable/27970468">Letter regarding "M. J. Kenney and S. J. Bezuszka, Calendar problem 12, 1997"</a>, Mathematics Teacher, 91 (1998), 155.
%e A049476 For n = 4, when we examine row 13 in A088643, the Roche algorithm produces the initial row values 13, 10, 9, 8, 11, 12. The remaining values are equal to row 7 in A088643, and at no earlier point in row 13 are the remaining values equal to row m, 7 < m < 13. So we calculate the difference between 13 and 7 ("the uncharted length") to be 6, which is longer than the previous record uncharted length (A049478(3) = 4) set by row a(3) = 5. So a(4) = 13. - _Peter Munn_, Aug 03 2021 (based on text supplied by _J. Stauduhar_)
%o A049476 (PARI) {print1(m=0); for( n=1, oo, my( r=A088643_row(n)); for( g=1, #r-1, if( Set(r[1..g]) == [n-g+1..n] && r[g+1]==n-g, g > m && print1(","n)+ m=g; break)))} \\ _M. F. Hasler_, Aug 04 2021
%Y A049476 Cf. A049477, A049478, A088643, A346778.
%K A049476 nonn,nice
%O A049476 1,2
%A A049476 _N. J. A. Sloane_
%E A049476 Revised by _Sean A. Irvine_, Aug 03 2021