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.

A093361 Add/multiply sequence, see example.

This page as a plain text file.
%I A093361 #26 Apr 18 2023 17:41:43
%S A093361 1,3,7,11,27,33,69,77,141,151,251,263,407,421,617,633,889,907,1231,
%T A093361 1251,1651,1673,2157,2181,2757,2783,3459,3487,4271,4301,5201,5233,
%U A093361 6257,6291,7447,7483,8779,8817,10261,10301,11901,11943,13707,13751,15687,15733,17849
%N A093361 Add/multiply sequence, see example.
%C A093361 It appears that a(2*n+1) = 2*(n + A002623(2*n-1)) + 3. - _Carl Najafi_, Jan 21 2013
%H A093361 Harvey P. Dale, <a href="/A093361/b093361.txt">Table of n, a(n) for n = 0..1000</a>
%H A093361 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-3,-3,3,1,-1).
%F A093361 a(n) = (1/24)*(4*n^3 + 12*n^2 + 20*n + 33 + (6*n^2 - 9)*(-1)^n). - _Ralf Stephan_, Dec 02 2004
%F A093361 G.f.: (1 + 2*x + x^2 - 2*x^3 + 7*x^4 - x^6)/((1 + x)^3*(x - 1)^4). - _R. J. Mathar_, May 20 2013
%F A093361 E.g.f.: ((12 + 15*x + 15*x^2 + 2*x^3)*cosh(x) + (21 + 21*x + 9*x^2 + 2*x^3)*sinh(x))/12. - _Stefano Spezia_, Apr 18 2023
%e A093361 a(0) = 1
%e A093361 a(1) = 1+2
%e A093361 a(2) = 1+2*3
%e A093361 a(3) = 1+2*3+4
%e A093361 a(4) = 1+2*3+4*5
%e A093361 a(5) = 1+2*3+4*5+6
%e A093361 a(6) = 1+2*3+4*5+6*7
%e A093361 a(7) = 1+2*3+4*5+6*7+8
%e A093361 a(8) = 1+2*3+4*5+6*7+8*9
%t A093361 LinearRecurrence[{1,3,-3,-3,3,1,-1},{1,3,7,11,27,33,69},50] (* _Harvey P. Dale_, Jun 02 2019 *)
%Y A093361 Cf. A002623.
%K A093361 nonn,easy
%O A093361 0,2
%A A093361 _Jorge Coveiro_, Apr 28 2004
%E A093361 More terms from _Ralf Stephan_, Dec 02 2004