Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132754
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A132754
%S A132754 0,12,25,39,54,70,87,105,124,144,165,187,210,234,259,285,312,340,369,
%T A132754 399,430,462,495,529,564,600,637,675,714,754,795,837,880,924,969,1015,
%U A132754 1062,1110,1159,1209,1260,1312,1365,1419,1474,1530
%N A132754 n(n+23)/2.
%F A132754 a(n) = n*(n+23)/2.
%F A132754 If we define f(n,i,a)=sum(binomial(n,k)*stirling1(n-k,i)*product(-a-j,
               j=0..k-1),k=0..n-i), then a(n) = -f(n,n-1,12), for n>=1. [From Milan 
               R. Janjic (agnus(AT)blic.net), Dec 20 2008]
%F A132754 a(n)=n+a(n-1)+10 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Nov 19 2009]
%e A132754 For n=2, a(2)=2+0+10=12; n=3, a(3)=3+12+10=25; n=4, a(4)=4+25+10=39 [From 
               Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 19 2009]
%p A132754 seq(sum(3*k-n, k=6..n), n=5..50); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               Feb 15 2008
%p A132754 a:=n->sum(denom (k/(k+3)), k=9..n): seq(a(n), n=8..53); - Zerinvary Lajos 
               (zerinvarylajos(AT)yahoo.com), May 31 2008
%t A132754 i=-11;s=0;lst={};Do[s+=n+i;If[s>=0, AppendTo[lst, s]], {n, 0, 6!, 1}];
               lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 29 2008]
%Y A132754 Cf. A000217, A056126.
%Y A132754 Sequence in context: A136739 A042851 A041280 this_sequence A164577 A058848 
               A042869
%Y A132754 Adjacent sequences: A132751 A132752 A132753 this_sequence A132755 A132756 
               A132757
%K A132754 easy,nonn,new
%O A132754 0,2
%A A132754 Omar E. Pol (info(AT)polprimos.com), Aug 28 2007

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research