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!)
A100462 Leading diagonal of array in A100461. 3

%I #10 Apr 07 2023 09:26:42

%S 1,1,1,3,7,25,49,109,229,481,1003,2019,4051,8143,16309,32683,65439,

%T 131007,262081,524187,1048423,2097027,4194147,8388481,16777039,

%U 33554269,67108699,134217529,268435227,536870713,1073741607,2147483371,4294967043,8589934267,17179868869

%N Leading diagonal of array in A100461.

%H G. C. Greubel, <a href="/A100462/b100462.txt">Table of n, a(n) for n = 1..1000</a>

%t t[n_, k_]:= t[n, k]= If[k==1, 2^(n-1), (n-k+1)*Floor[(t[n,k-1] -1)/(n - k+1)]]; (* t = A100461 *)

%t Table[t[n,n], {n,40}] (* _G. C. Greubel_, Apr 07 2023 *)

%o (Magma)

%o function t(n,k) // t = A100461

%o if k eq 1 then return 2^(n-1);

%o else return (n-k+1)*Floor((t(n,k-1) -1)/(n-k+1));

%o end if;

%o end function;

%o [t(n,n): n in [1..40]]; // _G. C. Greubel_, Apr 07 2023

%o (SageMath)

%o def t(n,k): # t = A100461

%o if (k==1): return 2^(n-1)

%o else: return (n-k+1)*((t(n, k-1) -1)//(n-k+1))

%o [t(n,n) for n in range(1,41)] # _G. C. Greubel_, Apr 07 2023

%Y Cf. A100461, A100463.

%K nonn

%O 1,4

%A _N. J. A. Sloane_, Nov 22 2004

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 July 30 06:28 EDT 2024. Contains 374737 sequences. (Running on oeis4.)