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!)
A260262 Number of digits of hyperfactorial(hyperfactorial(n)). 2

%I #16 Aug 29 2015 14:45:10

%S 1,1,5,10703,1614696745,28812381422477890,100652205682053466439353073,

%T 100862590668529143951825397261798321446,

%U 39596172587764149886638486692811308322476202830248047,7942534398808419809836601901425429825855063583537701822391757140131840

%N Number of digits of hyperfactorial(hyperfactorial(n)).

%H Matthew Campbell, <a href="/A260262/b260262.txt">Table of n, a(n) for n = 0..27</a>

%F a(n) = floor(log_10(hyperfactorial(hyperfactorial(n))))+1.

%F a(n) = A055642(A002109(A002109(n))).

%e Hyperfactorial(Hyperfactorial(1)) = 1. There is 1 digit in the number 1. Because of this, a(1) = 1.

%t Table[Floor[Log[10, Hyperfactorial[Hyperfactorial[n]]]] + 1, {n, 0, 3}]

%o (PARI) hyperfactorial(n)=prod(k=2,n,k^k)

%o first(m)=vector(m,i,#digits(hyperfactorial(hyperfactorial(i)))) \\ _Anders Hellström_, Aug 29 2015

%Y Cf. A002109, A055642.

%K nonn,easy,base

%O 0,3

%A _Matthew Campbell_, Jul 21 2015

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 07:34 EDT 2024. Contains 371905 sequences. (Running on oeis4.)