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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059833 "Madonna's Sequence": add 1 (mod 10) to each digit of Pi. 2
4, 2, 5, 2, 6, 0, 3, 7, 6, 4, 6, 9, 0, 8, 0, 4, 3, 4, 9, 5, 7, 3, 7, 5, 4, 4, 9, 4, 3, 8, 0, 6, 1, 3, 9, 9, 5, 2, 0, 8, 2, 7, 0, 4, 0, 0, 4, 8, 6, 2, 1, 6, 9, 3, 1, 0, 8, 5, 0, 5, 5, 6, 0, 3, 4, 1, 8, 9, 2, 7, 5, 1, 7, 3, 9, 7, 3, 1, 9, 0, 0, 9, 7, 3, 9, 1, 4, 5, 9, 3, 6, 4, 5, 3, 2, 2, 8, 1, 7, 8, 0, 9, 3, 2, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

REFERENCES

C. Pickover, Wonders of Numbers, Oxford University Press, 2001, p. 194.

LINKS

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

C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review

MAPLE

Digits := 300: with(numtheory): it := evalf(Pi/10, 300)-floor(evalf(Pi/10, 300)): for i from 1 to 300 do printf(`%d, `, floor(10*it)+1 mod 10): it := 10*it-floor(10*it): od:

MATHEMATICA

Mod[#+1, 10]&/@RealDigits[Pi, 10, 120][[1]] (* Harvey P. Dale, Jul 19 2011 *)

CROSSREFS

Sequence in context: A107046 A072907 A211174 * A123152 A243855 A065187

Adjacent sequences:  A059830 A059831 A059832 * A059834 A059835 A059836

KEYWORD

easy,nonn,base

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Feb 25 2001

EXTENSIONS

More terms from James A. Sellers, Feb 26 2001

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified October 1 06:15 EDT 2014. Contains 247503 sequences.