login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A135635 Triangle read by rows, constructed by the Pascal rule, with top entry 2, left edge = odd numbers, right edge = squares plus 1. 1

%I #6 Oct 25 2016 03:10:44

%S 2,3,5,5,8,10,7,13,18,17,9,20,31,35,26,11,29,51,66,61,37,13,40,80,117,

%T 127,98,50,15,53,120,197,244,225,148,65,17,68,173,317,441,469,373,213,

%U 82,19,85,241,490,758,910,842,586,295,101

%N Triangle read by rows, constructed by the Pascal rule, with top entry 2, left edge = odd numbers, right edge = squares plus 1.

%H G. C. Greubel, <a href="/A135635/b135635.txt">Table of n, a(n) for the first 25 rows</a>

%e ............2

%e ...........3.5

%e ..........5.8.10

%e ........7.13.18.17

%e .......9.20.31.35.26

%e .....11.29.51.66.61.37

%p T:=proc(n,k)if n=1 and k=1 then 2 elif k=1 then 2*n-1 elif n < k then 0 elif k =n then n^2+1 else T(n-1,k)+T(n-1,k-1) end if end proc: for n to 10 do seq(T(n,k),k=1..n) end do; # yields sequence in triangular form - _Emeric Deutsch_, Mar 03 2008

%t T[1, 1]:= 2; T[n_, 1]:= 2*n - 1; T[n_, n_]:= n^2 + 1; T[n_, k_] := T[n - 1, k] + T[n - 1, k - 1]; Table[T[n, k], {n, 1, 10}, {k, 1, n}]//Flatten (* _G. C. Greubel_, Oct 25 2016 *)

%Y Cf. A002522.

%K nonn,tabl

%O 1,1

%A David Williams (davidwilliams(AT)paxway.com), Mar 01 2008

%E More terms from _Emeric Deutsch_, Mar 03 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 16:01 EDT 2024. Contains 371749 sequences. (Running on oeis4.)