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.

A077293 Partition the concatenation 1234567...of natural numbers into successive strings nontrivially (a(n) is not equal to n) such that the n-th string is a multiple of n.

This page as a plain text file.
%I A077293 #10 May 16 2020 12:04:49
%S A077293 12,34,567,8,910,111213141516,17181920,2122232425262728,293031,
%T A077293 323334353637383940,41424344454647,48,
%U A077293 49505152535455565758596061626364,6566,676869707172737475,767778798081828384,85,868788
%N A077293 Partition the concatenation 1234567...of natural numbers into successive strings nontrivially (a(n) is not equal to n) such that the n-th string is a multiple of n.
%C A077293 a(1) = 12, a(n) = smallest concatenation of next successive natural numbers that is a multiple of n, or 0 if no such concatenation exists.
%C A077293 a(1) = 1 would have given a trivial sequence 1,2,3,4,5....
%C A077293 Every partial concatenation is a left substring of the concatenation of natural numbers.
%F A077293 a(n) = A077294(n)*n. - _Jinyuan Wang_, May 16 2020
%e A077293 a(2) = 34 = 2*17; a(7) = 17181920 = 7*2454560.
%o A077293 (PARI) lista(nn) = {my(k=0, m); for(n=1, nn, m=k++; while(m%n>0 || m==n, m=eval(Str(m, k++))); print1(m, ", ")); } \\ _Jinyuan Wang_, May 16 2020
%Y A077293 Cf. A077294, A088597, A088598.
%K A077293 nonn,base
%O A077293 1,1
%A A077293 _Amarnath Murthy_, Nov 03 2002
%E A077293 Corrected and extended by _Ray Chandler_, Oct 18 2003