login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248858 a(n) is number of digits of the smallest term of the sequence A248857 which is of the form 4^n*(5^(2n-1)*10^m-1). 1
4, 5, 7, 10, 14, 14, 16, 17, 42, 24, 47, 25, 29, 39, 31, 40, 41, 45, 40, 69, 46, 65, 807, 128, 67, 89, 55, 217, 87, 76, 74, 72, 99, 70, 75, 144, 78, 213, 96, 233, 114, 103, 457, 108, 156, 163, 140, 97, 127, 270, 109, 127, 167, 135, 128, 131, 196, 133, 309, 138, 148, 140, 813, 169, 135, 148, 235, 7235 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..68.

EXAMPLE

a(1) = number of digits of 1996 = 4.

a(2) = number of digits of 19984 = 5.

a(3) = number of digits of 1999936 = 7 and

a(68)=7235, because smallest prime of the form 5^(2*68-1)*10^m -1 is 5^135*10^7099-1 and 4^68(5^135*10^7099-1) has 7235 digits.

CROSSREFS

Cf. A248857.

Sequence in context: A202342 A234141 A093517 * A145018 A018910 A022936

Adjacent sequences:  A248855 A248856 A248857 * A248859 A248860 A248861

KEYWORD

nonn,base

AUTHOR

Farideh Firoozbakht, Jan 06 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 17:18 EST 2019. Contains 329879 sequences. (Running on oeis4.)