The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A099144 Numbers n such that the equation S(k) = S(n+k) has no solutions for k <= n, where S is the Kempner function A002034. 1
1, 2, 6, 24, 48, 120, 240, 720 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
No other n < 10^6. Note that n is a factorial or twice a factorial. For n = 1 and 6, there is no known k such that S(k) = S(n+k). For n = 2, 24, 48, 120, 240 and 720, the least k is respectively 16, 48, 10192, 240, 3600 and 3888.
LINKS
Eric Weisstein's World of Mathematics, Smarandache Function
MATHEMATICA
(*See A002034 for the Kempner function*) a=Table[Kempner[i], {i, 2000}]; lst={}; Do[i=1; While[i<=n&&a[[i]] != a[[i+n]], i++ ]; If[i>n, AppendTo[lst, n]], {n, 1000}]; lst
CROSSREFS
Cf. A099143 (least k such that S(k) = S(k+n)).
Sequence in context: A004306 A092485 A113904 * A354216 A189851 A189563
KEYWORD
nonn
AUTHOR
T. D. Noe, Sep 30 2004
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 June 3 19:11 EDT 2024. Contains 373087 sequences. (Running on oeis4.)