|
Search: id:A100468
|
|
|
| A100468 |
|
Numbers n such that n appears in the decimal representation of 1/n. |
|
+0
1
|
|
| 1, 3, 6, 7, 10, 14, 17, 28, 58, 59, 83, 86, 87, 89, 97, 100, 118, 167, 197, 228, 281, 313, 316, 339, 367, 379, 383, 456, 458, 469, 529, 541, 543, 569, 577, 587, 593, 607, 618, 626, 629, 647, 669, 673, 677, 678, 683, 687, 701, 709, 719, 722, 727, 729, 767, 771, 772
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Terminating decimals are zero-extended, so that 10 appears in 0.100... = 1/10.
Let n >= 2 and let m = 10^floor(log10(n)+1) be the smallest power of 10 > n. Then n is in this sequence iff ceil(n^2/m) < ceil((n^2+n)/m) and there exists k >= 0 with 10^k == ceil(n^2/m) (mod n). - David W. Wilson, Dec 14 2006
As n increases, the average number of digits in the decimal expansion of 1/n grows fairly steadily. It takes a jump at powers of ten. So the density of the present sequence grows steadily until a new power of ten is reached, when there is an abrupt drop. - Franklin T. Adams-Watters, Dec 17 2006
|
|
LINKS
|
D. W. Wilson, Table of n, a(n) for n = 1..10000
|
|
EXAMPLE
|
a(6)=17 because 1/17=".0588235294117647" which contains "17"
|
|
PROGRAM
|
(PARI) f1(n, prec) = for(x=1, n, default(realprecision, prec); a=1./x; if(countmatch(a, x), print1(x", "))) countmatch(str, match) = \Count the unique occurrences of string match in string str { local(lnm, lns, x, c); str=Str(str); \This allows leaving quotes off input match=Str(match); c=0; i=0; lns=length(str); lnm=length(match); if(lnm>1, i=1); x=1; while(x<=lns-lnm+1, if(mid(str, x, lnm)== match, c++; x+=lnm, x++); ); return(c) } - Cino Hilliard (hillcino368(AT)gmail.com), Jan 04 2005
|
|
CROSSREFS
|
Cf. A100469.
Sequence in context: A096068 A045412 A047281 this_sequence A035000 A024412 A115127
Adjacent sequences: A100465 A100466 A100467 this_sequence A100469 A100470 A100471
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Gil Broussard (kikiriki(AT)mindspring.com), Nov 20 2004
|
|
|
Search completed in 0.002 seconds
|
