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!)
A280532 a(1) = a(2) = 1, a(n) = A014777(a(n-1) + a(n-2)), n >= 3. 1

%I #41 Feb 06 2017 02:11:13

%S 1,1,6,13,37,31,605,1411,7174,15567,608953,78903,334535,611552,105928,

%T 2557047,2979162,3263358,6242520,7825254,37404834,267494881,639174488

%N a(1) = a(2) = 1, a(n) = A014777(a(n-1) + a(n-2)), n >= 3.

%H Dave Andersen, <a href="http://www.angio.net/pi/whynotpi.html">Probability of Finding Strings In Pi</a>

%H Anders Hellström, <a href="/A280532/a280532.spyx.txt">Sage program</a>

%H James Taylor, <a href="http://www.subidiom.com/pi/">Irrational Numbers Search Engine</a> (Search 2*10^9 decimal digits of Pi)

%t Module[{a = {1, 1}, s = First@ RealDigits[N[Pi, 10^7]]}, Do[AppendTo[a, -1 + SequencePosition[s, IntegerDigits[ a[[n - 1]] + a[[n - 2]] ]][[1, 1]]], {n, 3, 20}]; a] (* _Michael De Vlieger_, Jan 14 2017 *)

%Y Cf. A014777, A032445, A038100, A176341, A232013.

%K nonn,base,more

%O 1,3

%A _Anders Hellström_, Jan 13 2017

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 April 23 05:09 EDT 2024. Contains 371906 sequences. (Running on oeis4.)