login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A123153 a(n) = (n-th digit of Pi) times (the n-th prime number). 2
6, 3, 20, 7, 55, 117, 34, 114, 115, 87, 155, 296, 369, 301, 423, 159, 118, 183, 536, 284, 438, 158, 498, 356, 291, 303, 824, 321, 218, 791, 1143, 655, 0, 278, 1192, 1208, 628, 163, 1503, 1211, 179, 1086, 1719, 579, 1773, 1791, 633, 1561, 1135, 229, 0, 1195 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Albert Frank, International Contest Of Logical Sequences, 2002 - 2003. Item 5.
EXAMPLE
a(1) = 3*2 = 6; a(2) = 1*3 = 3; a(3) = 4*5 = 20; ...
MATHEMATICA
Module[{nn=60, pd}, pd=RealDigits[Pi, 10, nn][[1]]; Table[Prime[n]*pd[[n]], {n, nn}]] (* Harvey P. Dale, Sep 25 2014 *)
PROG
(Magma)
pi:=Pi(RealField(130));
A000796:= Reverse(Intseq(Floor(10^110*pi))); // Bruno Berselli's code
[A000796[n]*NthPrime(n): n in [1..100]]; // G. C. Greubel, Jul 18 2023
(SageMath)
x=numerical_approx(pi, digits=130)
b=[ZZ(i) for i in x.str(skip_zeroes=True) if i.isdigit()]
[nth_prime(n)*b[n-1] for n in range(1, 101)] # G. C. Greubel, Jul 18 2023
CROSSREFS
Sequence in context: A019069 A213752 A134410 * A276805 A185783 A288059
KEYWORD
nonn,base
AUTHOR
Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 01 2006
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 19:34 EDT 2024. Contains 375518 sequences. (Running on oeis4.)