Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057555
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057555 Lexicographic ordering of {1,2,3...}^2. +0
1
1, 1, 1, 2, 2, 1, 1, 3, 2, 2, 3, 1, 1, 4, 2, 3, 3, 2, 4, 1, 1, 5, 2, 4, 3, 3, 4, 2, 5, 1, 1, 6, 2, 5, 3, 4, 4, 3, 5, 2, 6, 1, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 6, 2, 7, 1, 1, 8, 2, 7, 3, 6, 4, 5, 5, 4, 6, 3, 7, 2, 8, 1, 1, 9, 2, 8, 3, 7, 4, 6, 5, 5, 6, 4, 7, 3, 8, 2, 9, 1, 1, 10, 2, 9, 3, 8, 4, 7, 5, 6, 6, 5, 7, 4 (list; graph; listen)
OFFSET

1,4

FORMULA

a(2n)=A004736(n), a(2n+1)=A002260(n). - Michael Somos Mar 06 2004

EXAMPLE

Ordered lattice points: (1,1)<(1,2)<(2,1)<(1,3)<(2,2)<...

PROGRAM

(PARI) a(n)=if(n<1, 0, 1+(-1)^(n%2)*(binomial((n+1)%2+(sqrtint(4*n)+1)\2, 2)-n\2)) - Michael Somos Mar 06 2004

CROSSREFS

Adjacent sequences: A057552 A057553 A057554 this_sequence A057556 A057557 A057558

Sequence in context: A117545 A047000 A139767 this_sequence A075532 A050176 A047130

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Sep 07 2000

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research