cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A110883 Sum of consecutive digits in the decimal expansion of Pi.

This page as a plain text file.
%I A110883 #24 Aug 22 2025 08:51:31
%S A110883 4,5,5,6,14,11,8,11,8,8,13,17,16,16,12,5,5,11,12,10,8,8,10,7,6,11,11,
%T A110883 5,9,16,14,5,2,10,16,12,5,10,16,8,7,15,12,12,18,12,10,12,6,1,5,13,10,
%U A110883 2,9,16,11,13,13,8,9,14,11,5,3,7,15,9,7,10,4,6,8,10,14,8,2,8,17,18,17,14,8
%N A110883 Sum of consecutive digits in the decimal expansion of Pi.
%H A110883 Paolo Xausa, <a href="/A110883/b110883.txt">Table of n, a(n) for n = 1..10000</a>
%H A110883 Blaine Deal, <a href="http://seqpost.notlong.com">Sequence puzzle posting at Clifford Pickover forum</a>. [Broken link]
%H A110883 Blaine Deal, <a href="http://pi314159.notlong.com">Home Page</a>.
%H A110883 Albert Frank and Philippe Jacqueroux, <a href="http://www.paulcooijmans.com/others/intcontest.pdf">International Contest</a>, 2001. Item 25.
%F A110883 a(n) = p(n) + p(n+1) where p(n) is the n-th digit of Pi (see sequence A000796).
%F A110883 a(n) = A000796(n) + A000796(n+1).
%e A110883 a(1)=3+1 = 4, a(2)=1+4 = 5, a(3)=4+1 = 5, a(4)=1+5 = 6, a(5)=5+9 = 14
%t A110883 listlength = 100; Table[IntegerDigits[IntegerPart[10^listlength Pi]][[i]] + IntegerDigits[IntegerPart[10^listlength (Pi - 3.0`100)]][[i]], {i, 1, listlength}]
%t A110883 (* Second program: *)
%t A110883 Total[Partition[First[RealDigits[Pi, 10, 100]], 2, 1], {2}] (* _Paolo Xausa_, Aug 22 2025 *)
%Y A110883 Cf. A000796.
%K A110883 base,nonn
%O A110883 1,1
%A A110883 _Blaine J. Deal_ and _Mark Nandor_, Sep 19 2005
%E A110883 Typo in formula fixed by _Zak Seidov_, Jan 02 2014