login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179801 Count of times n appears in number created by stringing together previous n-1 integers 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
2 first appears for n=121; 3 first appears for n=1011; 4 first appears for n=1121; 5 first appears for n=10111. - Harvey P. Dale, Jul 22 2013
LINKS
EXAMPLE
a(6)=0 because stringing together the first 5 integers gives the number "12345" and 6 does not appear in 12345.
a(12)=1 because stringing together the first 11 integers gives "1234567891011" and 12 appears once in 1234567891011 (right at the beginning).
MATHEMATICA
Table[idn=IntegerDigits[n]; fid=Flatten[IntegerDigits/@Range[n-1]]; Count[ Partition[ fid, Length[idn], 1], idn], {n, 0, 110}] (* Harvey P. Dale, Jul 22 2013 *)
Table[SequenceCount[Flatten[IntegerDigits/@Range[n-1]], IntegerDigits[n]], {n, 120}] (* Harvey P. Dale, Apr 16 2023 *)
PROG
(PHP) for($x = 1; $x <= 1000; $x++) {
echo "$x: " . substr_count($running, $x) ."<br />" ;
$running = $running . $x ;
}
CROSSREFS
Sequence in context: A355454 A107846 A354983 * A353474 A065202 A323547
KEYWORD
nonn,base
AUTHOR
Dominick Cancilla, Jul 27 2010
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:02 EDT 2024. Contains 371918 sequences. (Running on oeis4.)