cp's OEIS Frontend

A059833 "Madonna's Sequence": add 1 (mod 10) to each digit of Pi.

%I A059833 #24 Jul 02 2025 16:02:01
%S A059833 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,
%T A059833 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,
%U A059833 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
%N A059833 "Madonna's Sequence": add 1 (mod 10) to each digit of Pi.
%D A059833 Clifford Pickover, Wonders of Numbers, Oxford University Press, 2001, p. 194.
%H A059833 C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," <a href="http://www.zentralblatt-math.org/zmath/en/search/?q=an:0983.00008&amp;format=complete">Zentralblatt review</a>
%e A059833 4.25260376469080434957375449438...
%p A059833 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:
%t A059833 Mod[# + 1, 10]&/@RealDigits[Pi, 10, 120][[1]] (* _Harvey P. Dale_, Jul 19 2011 *)
%o A059833 (Python)
%o A059833 from sympy import S
%o A059833 def alist(nn): return [4]+[(1+int(d))%10 for d in str(S.Pi.n(nn+2))[2:nn+1]]
%o A059833 print(alist(105)) # _Michael S. Branicky_, Apr 02 2021
%K A059833 easy,nonn,base
%O A059833 1,1
%A A059833 _Jason Earls_, Feb 25 2001
%E A059833 More terms from _James Sellers_, Feb 26 2001
%E A059833 Offset set to 1 by _Alois P. Heinz_, Jul 05 2022