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 A169861 #21 Jul 14 2025 02:37:35 %S A169861 0,26,51,77,102,127,153,178,204,229,254,280,305,331,356,381,407,432, %T A169861 458,483,508,534,559,585,610,635,661,686,712,737,762,788,813,839,864, %U A169861 889,915,940,966,991,1016,1042,1067,1093,1118,1143,1169,1194,1220,1245,1270 %N A169861 Ceiling of n inches converted to millimeters. %H A169861 Paolo Xausa, <a href="/A169861/b169861.txt">Table of n, a(n) for n = 0..10000</a> %H A169861 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,1,-1). %F A169861 a(n) = ceiling(n*25.4) = ceiling(n*127/5). %F A169861 G.f.: x*(26 + 25*x + 26*x^2 + 25*x^3 + 25*x^4)/((1 - x)^2*(1 + x + x^2 + x^3 + x^4)). - _Stefano Spezia_, Jul 10 2025 %p A169861 seq(ceil(evalf(127*n/5)), n=0..50); # _Georg Fischer_, Aug 31 2021 %t A169861 Ceiling[Range[0, 50]*25.4] (* _Paolo Xausa_, Jul 14 2025 *) %Y A169861 Cf. A169860, A169861. %K A169861 nonn,easy %O A169861 0,2 %A A169861 _Jeremy Gardiner_, Jun 12 2010 %E A169861 Missing terms added by _Georg Fischer_, Aug 31 2021