Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081224
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081224 Smallest k such that floor(k*e^Pi) begins with n (e^Pi=23.14069264...). +0
2
5, 1, 13, 2, 22, 3, 31, 35, 4, 44, 5, 52, 6, 61, 65, 7, 74, 8, 83, 9, 91, 96, 1, 104, 11, 113, 12, 121, 126, 13, 134, 14, 143, 15, 152, 156, 16, 165, 17, 173, 18, 182, 19, 191, 195, 2, 204, 21, 212, 22, 221, 225, 23, 234, 24, 242, 25, 251, 255, 26, 264, 27, 273, 28, 281 (list; graph; listen)
OFFSET

1,1

COMMENT

Based on the sequences A078219 and A078220 of Amarnath Murthy (amarnath_murthy(AT)yahoo.com)

EXAMPLE

a(4) = 2 because floor(2*e^Pi) = 46.

MAPLE

C := exp(Pi); a := proc(M0, M, C) local i, d, f, g, k; description "returns the sequence 'a(n)' between 'M0' and 'M' where 'a(n)=min{k | floor(C*k) begins with n}."; d := N->`if`(N=0, [0], ListTools[Reverse](convert(N, base, 10))); f := (K, N)->`if`(d(floor(K*C))[1..min(nops(d(floor(K*C))), nops(d(N)))]=d(N), K, 0); for i from M0 to M do k := 0; while f(k, i)=0 do k := k+1; od; g(i) := f(k, i) od; return seq(g(j), j=M0..M); end proc;

CROSSREFS

Cf. A078219, A078220, A081223, A081225, A081226.

Sequence in context: A116923 A062264 A094049 this_sequence A104793 A067558 A104792

Adjacent sequences: A081221 A081222 A081223 this_sequence A081225 A081226 A081227

KEYWORD

nonn,base

AUTHOR

Francois Jooste (pin(AT)myway.com), Mar 10 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research