Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110349
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110349 a(n) = n + (n+1) +(n-1) +(n+2) + (n-2) ... n terms. +0
1
1, 5, 9, 18, 25, 39, 49, 68, 81, 105, 121, 150, 169, 203, 225, 264, 289, 333, 361, 410, 441, 495, 529, 588, 625, 689, 729, 798, 841, 915, 961, 1040, 1089, 1173, 1225, 1314, 1369, 1463, 1521, 1620, 1681, 1785, 1849, 1958, 2025, 2139, 2209, 2328, 2401, 2525 (list; graph; listen)
OFFSET

1,2

REFERENCES

Robert M. Ziff, "On Cardy's formula for the critical crossing probability in 2d percolation," J. Phys. A. 28, 1249-1255 (1995).

FORMULA

a(2n-1)=(2n-1)^2; a(2n)=4n^2+n. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 03 2005

EXAMPLE

a(4) = 4+5 +3 +6 = 18.

a(5) = 5+6+4 +7 +3 = 25.

MAPLE

a:=proc(n) if n mod 2 = 0 then n^2+n/2 else n^2 fi end: seq(a(n), n=1..60); (Deutsch)

CROSSREFS

Sequence in context: A099213 A146067 A061502 this_sequence A036832 A116453 A046578

Adjacent sequences: A110346 A110347 A110348 this_sequence A110350 A110351 A110352

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 21 2005

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 03 2005

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research