Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082375
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082375 Triangular array read by rows: n-th row begins with n and decreases by 2 until 0 or 1 is reached. +0
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; listen)
OFFSET

0,3

COMMENT

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

EXAMPLE

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

PROGRAM

(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: A135156 A063277 A029178 this_sequence A025644 A022332 A025636

Adjacent sequences: A082372 A082373 A082374 this_sequence A082376 A082377 A082378

KEYWORD

nonn,tabf

AUTHOR

Michael Somos, Apr 9, 2003

page 1

Search completed in 0.002 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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research