cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A075000 Smallest number such that n*a(n) is a concatenation of n consecutive integers; or 0 if no such number exists.

Original entry on oeis.org

1, 6, 41, 864, 2469, 20576, 493827, 7098637639, 13717421, 1234567891, 82737383012865106529, 10288065758426, 3513762316247164732, 563643651522439401227280, 8230452606740808761
Offset: 1

Views

Author

Amarnath Murthy, Aug 31 2002

Keywords

Comments

Conjecture: For every n there exists a nonzero a(n).

Examples

			a(11) = 82737383012865106529 as 11*82737383012865106529 = 910111213141516171819 is the concatenation of 11 numbers from 9 to 19.

Links

Crossrefs

Cf. A074991, A074992, A074993, A074994, A074995, A074996, A036377, A073086, A074999, A075001.

Programs

  • Mathematica
    f[ n_ ] := Block[ {id = Range@n}, While[ k = FromDigits@ Flatten@ IntegerDigits@ id/n; !IntegerQ@k, id++ ]; k ]; Array[ f, 16 ] (* Robert G. Wilson v, Oct 19 2007 *)

Formula

a(n) = A077306(n)/n. - Amarnath Murthy, Nov 03 2002

Extensions

More terms from Rick L. Shepherd, Sep 03 2002

A074999 Floor[concatenation of nine consecutive numbers from n to n+8 divided by 9].

Original entry on oeis.org

1371742, 13717421, 260630990, 3840876779, 50754344568, 630990012357, 7543445680146, 87677901347935, 990012357015724, 10112346812683513, 11234681268351302, 12357015724019091, 13479350179686880
Offset: 0

Views

Author

Amarnath Murthy, Aug 31 2002

Keywords

Links

Crossrefs

Cf. A074991, A074992, A074993, A074994, A074995, A074996, A036377, A073086.

Programs

  • Mathematica
    Table[FromDigits[Flatten[IntegerDigits/@Range[n,n+8]]]/9,{n,0,20}] (* Harvey P. Dale, Feb 19 2018 *)

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 18 2003

A073086 Floor[concatenation of eight consecutive numbers from n to n+7 divided by 8].

Original entry on oeis.org

154320, 1543209, 2932098, 43209863, 570986376, 7098637639, 84863763901, 986376390164, 11137639016426, 113763901642689, 126390164268952, 139016426895214, 151642689521477, 164268952147740, 176895214774002
Offset: 0

Views

Author

Amarnath Murthy, Aug 31 2002

Keywords

Crossrefs

Cf. A074991, A074992, A074993, A074994, A074995, A074996, A036377, A074999.

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 18 2003

A075001 Smallest k such that the concatenation of n consecutive numbers starting with k (from k to n+k-1) is a multiple of n; or 0 if no such number exists.

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 3, 5, 1, 1, 9, 1, 4, 7, 1, 5, 23, 1, 14, 1, 9, 9, 13, 5, 1, 21, 1, 13, 12, 1, 36, 21, 9, 3, 41, 1, 34, 33, 9, 21, 12, 9, 33, 9, 1, 13, 28, 5, 48, 1, 23, 21, 3, 1, 11, 13, 14, 41, 28, 1, 114, 115, 9, 41, 21, 9, 23, 69, 1, 61, 73, 5, 14, 43, 1, 145, 13, 9, 127, 41, 9, 95
Offset: 1

Views

Author

Amarnath Murthy, Aug 31 2002

Keywords

Comments

Conjecture: For every n there exists a k.
First occurrence of k where a(n)=k: 1, 103, 4, 13, 8, 105, 14, 87, 11, 699, 55, 29, 23, 19, 114, 261, 102, 97, 178, 219, 26, 121, 17, 151, 92, ..., . - Robert G. Wilson v
a(n)=1 iff n is in A029455. - Robert G. Wilson v
Increasing a(n)'s: 1, 3, 5, 9, 23, 36, 41, 48, 114, 115, 145, 166, 175, 221, 251, ..., at n = 1, 4, 8, 11, 17, 31, 35, 49, 61, 62, 76, 85, 122, 133, 170, 179, 217, 229, ..., . - Robert G. Wilson v

Examples

			a(11) = 9 as 910111213141516171819 the concatenation of 11 numbers from 9 to 19 is divisible by 11 (11*82737383012865106529).

Links

Crossrefs

Cf. A058183, A074991, A074992, A074993, A074994, A074995, A074996, A036377, A073086, A074999, A075000, A077306, A075000.
Cf. A029455 (indices of 1's).

Programs

  • Mathematica
    f[n_] := Block[{c = 1, id = Range@n}, While[k = FromDigits@Flatten@IntegerDigits@id/n; ! IntegerQ@k, id++; c++ ]; c]; Array[f, 82] (* Robert G. Wilson v, Oct 20 2007 *)
  • PARI
    /* The following program assumes the conjecture is true. */ /* It has found nonzero a(n) for n up to 500. */ {for(n=1,500, k=0; until(s%n==0,k++; s=0; for(m=k,k+n-1, s=s*(10^length(Str(m)))+m)); print1(k,","))}
  • PARI
    a(n) = {my(ld = 1, hd = n, qd, m = Mod(1, n), pow10, qdn = #digits(n), t=log(10*n+.5)\log(10)); qd = n*t+t-10^t\9; pow10 = Mod(10, n)^(qd-1); for(i = 2, n, m = m * Mod(10, n)^#digits(i) + i; ); while(1, if(lift(m) == 0, return(ld)); m -= ld * pow10; hd++; m = m * Mod(10, n)^#digits(hd) + hd; ld++; pow10*=10^(#digits(hd) - #digits(ld)); ) } \\ David A. Corneth, Aug 23 2020

Extensions

More terms from Rick L. Shepherd, Sep 03 2002

A075006 Floor[ concatenation of n+4, n+3, n+2, n+1 and n divided by 5].

Original entry on oeis.org

8642, 10864, 13086, 15308, 17530, 19753, 21975, 222197, 2422219, 26242221, 282624222, 302826242, 323028262, 343230282, 363432302, 383634323, 403836343, 424038363, 444240383, 464442403, 484644424, 504846444, 525048464, 545250484
Offset: 0

Views

Author

Amarnath Murthy, Sep 01 2002

Keywords

Crossrefs

Cf. A074991 to A075000, A075003 to A075005 and A036377 to A075010.

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 18 2003
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.