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!)
A025145 Numbers k such that (#1's in s(1),...,s(k)) = -1 + (#1's in r(1),...,r(k)), where s = A025142 and r = A025143. 0

%I #13 Jan 09 2024 16:10:43

%S 27,36,802,804,810,822,937,943,944,945,947,949,952,955,973,980,998,

%T 1007,1025,1033,1042,1045,1051,1052,1053,1060,1063,1069,1072,1075,

%U 1078,1087,1133

%N Numbers k such that (#1's in s(1),...,s(k)) = -1 + (#1's in r(1),...,r(k)), where s = A025142 and r = A025143.

%H H. Harborth, <a href="https://doi.org/10.1007/s005910050025">Probleme und Lösungen</a>, Mathematische Semesterberichte 44 (1997) 94.

%K nonn

%O 1,1

%A _Clark Kimberling_

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)