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!)
A112367 a(n) = A000217(n-k), where k is the largest triangular number less than n. 2
0, 0, 1, 0, 1, 3, 0, 1, 3, 6, 0, 1, 3, 6, 10, 0, 1, 3, 6, 10, 15, 0, 1, 3, 6, 10, 15, 21, 0, 1, 3, 6, 10, 15, 21, 28, 0, 1, 3, 6, 10, 15, 21, 28, 36, 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 0, 1, 3, 6, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
LINKS
FORMULA
a(n) = A000217(n-A057944(n)). - R. J. Mathar, Nov 05 2011
EXAMPLE
a(9) = T(9-6) = T(3) = 6. 6 < 9 < 10.
MAPLE
A112367 := proc(n)
t := A057944(n) ;
A000217(n-t) ;
end proc:
seq(A112367(n), n=0..80) ; # R. J. Mathar, Nov 05 2011
MATHEMATICA
trn[n_]:=Module[{c=Floor[(Sqrt[8n+1]-1)/2], x}, x=n-(c(c+1))/2; (x(x+1))/2]; Array[trn, 80, 0] (* Harvey P. Dale, Jul 19 2012 *)
CROSSREFS
Sequence in context: A121469 A091867 A127158 * A320801 A035623 A350178
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy, Sep 12 2005
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 April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)