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!)
 A130450 Sum of all n-digit Padovan numbers. 1

%I

%S 37,314,2978,28243,365083,3365185,31915109,302679996,2870589600,

%T 37106668865,342034020651,3243819596611,30764090529153,

%U 291763841329126,2767061780242106,35768416776972079,329698563001107755,3126831236266826873

%N Sum of all n-digit Padovan numbers.

%C The ratio of the (n+1)-th term to the n-th term is approximately 9.5.

%C The n-th term contains (n+1) digits.

%H Nathaniel Johnston, <a href="/A130450/b130450.txt">Table of n, a(n) for n = 1..200</a>

%e The sum of all 1-digit Padovan numbers is a(1)=37.

%e The sum of all 2-digit Padovan numbers is a(2)=314.

%p A000931 := proc(n) option remember: if(n=0)then return 1: elif(n<=2)then return 0: fi: return procname(n-2)+procname(n-3): end: for n from 0 to 200 do A130450[n]:=0: od: for n from 0 to 1643 do A130450[length(A000931(n))] := A130450[length(A000931(n))] + A000931(n): od: seq(A130450[n],n=1..20); # _Nathaniel Johnston_, May 05 2011

%Y Cf. A000931.

%K nonn,base

%O 1,1

%A _Parthasarathy Nambi_, Aug 08 2007, Aug 09 2007

%E a(9)-a(18) from _Nathaniel Johnston_, May 05 2011

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 July 11 23:26 EDT 2020. Contains 335652 sequences. (Running on oeis4.)