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!)
A235269 floor(s*t/(s+t)), where s(n) are the squares, t(n) the triangular numbers. 0
0, 1, 3, 6, 9, 13, 17, 23, 28, 35, 42, 50, 59, 68, 78, 88, 100, 111, 124, 137, 151, 166, 181, 197, 213, 231, 248, 267, 286, 306, 327, 348, 370, 392, 416, 439, 464, 489, 515, 542, 569, 597, 625, 655, 684, 715, 746, 778, 811, 844, 878, 912, 948, 983, 1020, 1057 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = floor(s*t/(s+t)) where s = A000290(n) = n^2, t = A000217(n) = n*(n+1)/2. a(n) = floor((n^3+n^2) / (3*n+1)).
G.f.: (-x^10 + 2*x^9 - x^8 + 2*x^7 + x^5 + x^3 + x^2 + x)/((1-x)^2*(1-x^9)). - Ralf Stephan, Jan 15 2014
MATHEMATICA
With[{nn=60}, Floor[Times@@#/Total[#]]&/@Thread[{Range[nn]^2, Accumulate[ Range[ nn]]}]] (* or *) LinearRecurrence[{2, -1, 0, 0, 0, 0, 0, 0, 1, -2, 1}, {0, 1, 3, 6, 9, 13, 17, 23, 28, 35, 42}, 60] (* Harvey P. Dale, Oct 07 2015 *)
PROG
(Python)
for n in range(1, 99):
s = n*n
t = n*(n+1)/2
print str(s*t//(s+t))+', ',
CROSSREFS
Sequence in context: A185173 A171662 A302292 * A004137 A080060 A004131
KEYWORD
nonn,easy
AUTHOR
Alex Ratushnyak, Jan 05 2014
STATUS
approved

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 May 7 21:53 EDT 2024. Contains 372317 sequences. (Running on oeis4.)