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!)
A073330 Let c(1)=n and c(k+1)=floor(c(k)/Pi) if c(k) is even, or c(k+1)=floor(Pi*c(k)) otherwise; sequence gives the smallest value a(n) such that c(a(n))=0. 0
7, 2, 6, 8, 18, 8, 14, 3, 5, 7, 9, 7, 9, 9, 17, 19, 23, 19, 31, 9, 13, 15, 17, 15, 17, 4, 6, 4, 22, 6, 10, 8, 14, 8, 12, 10, 12, 8, 10, 8, 10, 10, 14, 10, 14, 10, 16, 18, 22, 18, 20, 20, 22, 24, 26, 24, 28, 20, 30, 32, 36, 32, 36, 10, 12, 14, 16, 14, 16, 16, 20, 16, 22, 18, 22, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Conjecture: sequence always exists (a(123456789)=61, a(2^30)=70) and there is a constant C=2.8... such that sum(k=1, n, a(k)) is asymptotic to C*n*Log(n)
EXAMPLE
c(1)=1 => 3 => 9 => 28 => 8 => 2 => 0 => 0 => 0 ... hence a(1)=7.
PROG
(PARI) a(n)=if(n<0, 0, s=n; t=2; while(floor(s/Pi^(-1)^s)>0, s=floor(s/Pi^(-1)^s); t++); t )
CROSSREFS
Sequence in context: A011361 A199433 A095398 * A208852 A248284 A350620
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Aug 22 2002
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 March 29 03:51 EDT 2024. Contains 371264 sequences. (Running on oeis4.)