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!)
A123051 a(2*n-1) = (4*n-3)^(4*n-2) and a(2*n) = (4*n)^(4*n-1), n=1,2,... 1

%I #8 Jul 21 2021 09:16:52

%S 1,64,15625,2097152,3486784401,743008370688,3937376385699289,

%T 1152921504606846976,14063084452067724991009,

%U 5242880000000000000000000,122694327386105632949003612841,55572324035428505185378394701824

%N a(2*n-1) = (4*n-3)^(4*n-2) and a(2*n) = (4*n)^(4*n-1), n=1,2,...

%H G. C. Greubel, <a href="/A123051/b123051.txt">Table of n, a(n) for n = 1..100</a>

%H Sergio Silva, <a href="https://web.archive.org/web/20061105083600/http://ginasiomental.no.sapo.pt/materialc/mteste/teste.htm">Teste Numérico</a>.

%e Sequence gives the following terms: 1^2, 4^3, 5^6, 7^8, 9^10, 12^11, ...

%t a[n_]:= a[n]= If[EvenQ[n], (2*n)^(2*n-1), (2*n-1)^(2*n)];

%t Table[a[n], {n, 20}] (* _G. C. Greubel_, Jul 20 2021 *)

%o (PARI) for(k=1,10,print1((4*k-3)^(4*k-2),",",(4*k)^(4*k-1),","))

%o (Sage)

%o def a(n): return (2*n)^(2*n-1) if (n%2==0) else (2*n-1)^(2*n)

%o [a(n) for n in (1..20)] # _G. C. Greubel_, Jul 20 2021

%K nonn

%O 1,2

%A Herman Jamke (hermanjamke(AT)fastmail.fm), Sep 25 2006

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)