Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Feb 13 2021 21:29:34
%S 1,12,34,123,456,789,1234,5678,9012,3456,12345,67890,12345,67890,
%T 12345,123456,789012,345678,901234,567890,123456,1234567,8901234,
%U 5678901,2345678,9012345,6789012,3456789,12345678,90123456,78901234,56789012
%N In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the triangle by rows.
%H Harvey P. Dale, <a href="/A078194/b078194.txt">Table of n, a(n) for n = 1..1000</a>
%p A078194 := proc(n,m) local istrt,iend,resul ; istrt := ( 1+m*n ) mod 10 ; iend := istrt+n-1 ; resul := istrt ; for i from istrt+1 to iend do resul := 10*resul+ (i mod 10) ; od ; RETURN(resul) ; end: for n from 1 to 10 do for m from 0 to n-1 do printf("%d, ",A078194(n,m)) ; od ; od ; # _R. J. Mathar_, Apr 01 2007
%t Table[FromDigits/@Partition[PadRight[{},n^2,Join[Range[9],{0}]],n],{n,10}]//Flatten (* _Harvey P. Dale_, Apr 25 2020 *)
%Y Cf. A078193, A078195.
%K base,easy,nonn
%O 1,2
%A _Amarnath Murthy_, Nov 21 2002
%E More terms from _R. J. Mathar_, Apr 01 2007