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!)
A094227 A prime-power sequence based on Gaussian asymptotic function. 0
0, 1, 3, 5, 8, 10, 13, 15, 18, 21, 24, 27, 30, 33, 36, 40, 43, 46, 50, 53, 57, 61, 64, 68, 72, 75, 79, 83, 87, 91, 95, 99, 102, 106, 111, 115, 119, 123, 127, 131, 135, 139, 144, 148, 152, 157, 161, 165, 170, 174, 178, 183, 187, 192, 196, 201, 205, 210, 214, 219, 223 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,3
LINKS
FORMULA
a(n) = Floor[N[n*(n-1)^s(n)]] with s(n)=(Log[g[n]]-Log[n])/Log[n-1] and g[n]=(n*Pi*Log[n]-Sqrt[n^2*Pi+2*Pi^2*n])/Pi.
a(n) ~ n log n. - Charles R Greathouse IV, Aug 24 2022
MATHEMATICA
g[n_]=(n*Pi*Log[n]-Sqrt[n^2*Pi+2*Pi^2*n])/Pi f[n_]=(Log[g[n]]-Log[n])/Log[n-1] a=Table[Floor[N[n*(n-1)^fa[n]]], {n, 3, 200}]
PROG
(PARI) s(n)=log(log(n) - sqrt(1/Pi+2/n))/log(n-1)
a(n)=n*(n-1)^s(n)\1 \\ Charles R Greathouse IV, Aug 24 2022
CROSSREFS
Sequence in context: A332102 A047218 A029919 * A085225 A080370 A175540
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, May 28 2004
STATUS
approved

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 27 20:03 EDT 2024. Contains 372020 sequences. (Running on oeis4.)