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 A257645 #28 Dec 27 2023 22:44:06 %S A257645 14,29,44,59,74,89,104,119,134,149,164,179,194,209,224,239,254,269, %T A257645 284,299,314,329,344,359,374,389,404,419,434,449,464,479,494,509,524, %U A257645 539,554,569,584,599,614,629,644,659,674,689,704,719,734,749,764,779 %N A257645 a(n) = 15*n + 14. %C A257645 A123159(a(n)) <= 4. %C A257645 This is not a subsequence of A047725 (for example, 239 is missing in A047725). - _Bruno Berselli_, Nov 06 2015 %C A257645 Equivalently, intersection of A016897 and A016789. - _Bruno Berselli_, Jan 24 2018 %H A257645 G. C. Greubel, <a href="/A257645/b257645.txt">Table of n, a(n) for n = 0..5000</a> %H A257645 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A257645 G.f.: (14 + x)/(1 - x)^2. %F A257645 a(n) = A008597(n+1) - 1. - _Omar E. Pol_, Nov 05 2015 %F A257645 a(n) = A016897(3n+2) = A175887(2n+2) = A204542(4n+4). - _Bruno Berselli_, Nov 06 2015 %F A257645 E.g.f.: (15*x + 14)*exp(x). - _G. C. Greubel_, Apr 23 2018 %F A257645 a(n) = 2*a(n-1)-a(n-2). - _Wesley Ivan Hurt_, Dec 27 2023 %p A257645 seq(15*n+14, n=0..51); %t A257645 15 Range[50] - 1 %o A257645 (Magma) [15*n+14: n in [0..51]]; %o A257645 (PARI) for(n=0, 51, print1(15*n+14, ", ")); %Y A257645 Cf. A008597, A016897, A175887, A123159, A204542. %K A257645 nonn,easy %O A257645 0,1 %A A257645 _Arkadiusz Wesolowski_, Nov 05 2015