login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082375 Triangular array read by rows: n-th row begins with n and decreases by 2 until 0 or 1 is reached. 1
0, 1, 2, 0, 3, 1, 4, 2, 0, 5, 3, 1, 6, 4, 2, 0, 7, 5, 3, 1, 8, 6, 4, 2, 0, 9, 7, 5, 3, 1, 10, 8, 6, 4, 2, 0, 11, 9, 7, 5, 3, 1, 12, 10, 8, 6, 4, 2, 0, 13, 11, 9, 7, 5, 3, 1, 14, 12, 10, 8, 6, 4, 2, 0, 15, 13, 11, 9, 7, 5, 3, 1, 16, 14, 12, 10, 8, 6, 4, 2, 0, 17, 15, 13, 11, 9, 7, 5, 3, 1, 18, 16, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n)=A025644(n+1) for n<=142.

LINKS

Table of n, a(n) for n=0..92.

EXAMPLE

0; 1; 2,0; 3,1; 4,2,0; 5,3,1; 6,4,2,0; 7,5,3,1; ...

PROG

(PARI) a(n)=local(m); if(n<0, 0, m=sqrtint(1+4*n); m-1-(1+4*n-m^2)\2)

CROSSREFS

Sequence in context: A194549 A063277 A029178 * A025644 A022332 A215589

Adjacent sequences:  A082372 A082373 A082374 * A082376 A082377 A082378

KEYWORD

nonn,tabf

AUTHOR

Michael Somos, Apr 09 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 23 09:54 EST 2017. Contains 295116 sequences.