The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A123153 a(n) = (n-th digit of Pi) times (the n-th prime number). 1

%I

%S 6,3,20,7,55,117,34,114,115,87,155,296,369,301,423,159,118,183,536,

%T 284,438,158,498,356,291,303,824,321,218,791,1143,655,0,278,1192,1208,

%U 628,163,1503,1211,179,1086,1719,579,1773,1791,633,1561,1135,229,0,1195

%N a(n) = (n-th digit of Pi) times (the n-th prime number).

%H Harvey P. Dale, <a href="/A123153/b123153.txt">Table of n, a(n) for n = 1..1000</a>

%H Albert Frank, <a href="http://www.paulcooijmans.com/oth/intcont2003.html">International Contest Of Logical Sequences</a>, 2002 - 2003. Item 5

%H Albert Frank, <a href="http://www.paulcooijmans.com/oth/intcont2003ans.html">Solutions of International Contest Of Logical Sequences</a>, 2002 - 2003.

%e a(1)=3*2=6; a(2)=1*3=3; a(3)=4*5=20;...

%t Module[{nn=60,pd},pd=RealDigits[Pi,10,nn][[1]];Table[Prime[n]*pd[[n]],{n,nn}]] (* _Harvey P. Dale_, Sep 25 2014 *)

%K nonn,base

%O 1,1

%A Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 01 2006

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

Last modified May 6 21:35 EDT 2021. Contains 343597 sequences. (Running on oeis4.)