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!)
A133610 Partial sums of pyramidal sequence A053616. 1
0, 0, 1, 1, 2, 3, 3, 4, 6, 7, 7, 8, 10, 12, 13, 13, 14, 16, 19, 21, 22, 22, 23, 25, 28, 31, 33, 34, 34, 35, 37, 40, 44, 47, 49, 50, 50, 51, 53, 56, 60, 64, 67, 69, 70, 70, 71, 73, 76, 80, 85, 89, 92, 94, 95, 95, 96, 98, 101, 105, 110, 115, 119, 122, 124, 125, 125, 126, 128, 131, 135 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
FORMULA
a(n) = SUM[i=0..n] distance from i to nearest triangular number = SUM[i=0..n]MIN{|i - (k*(k+1)/2)|} = SUM[i=0..n] MIN{|A000217(i) - i|}.
PROG
(Haskell)
a133610 n = a133610_list !! n
a133610_list = scanl1 (+) a053616_list
-- Reinhard Zumkeller, Jan 24 2014
CROSSREFS
Sequence in context: A023158 A120882 A102187 * A256211 A265109 A301277
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Dec 28 2007
EXTENSIONS
Data corrected by Reinhard Zumkeller, Jan 24 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 March 29 09:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)