Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069159
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069159 a(n) = d(1) - d(2) + d(3) - d(4) + ... + (-1)^(n+1) d(n), where d(k) denotes the k-th term of the digit sequence 3, 1, 4, 1, 5, 9,.... of Pi. +0
1
3, 2, 6, 5, 10, 1, 3, -3, 2, -1, 4, -4, 5, -2, 7 (list; graph; listen)
OFFSET

1,1

LINKS

K. S. Brown, Random Walk Through Pi

FORMULA

a(1) = d(1) = 3; a(n) = a(n-1) + (-1)^(n+1) d(n) for n > 1.

EXAMPLE

a(3) = d(1) - d(2) + d(3) = 3 - 1 + 4 = 6.

CROSSREFS

Sequence in context: A046877 A067587 A120476 this_sequence A085179 A113782 A090868

Adjacent sequences: A069156 A069157 A069158 this_sequence A069160 A069161 A069162

KEYWORD

base,easy,sign

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Apr 09 2002

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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research