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!)
A330696 Flimsy primes. 0

%I #11 Feb 10 2020 06:16:40

%S 11,13,19,23,29,37,41,43,47,53,59,61,67,71,79,83,97,101,103,107,109,

%T 113,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,

%U 223,227,229,233,239,241,251,263,269,271,277,281,283,293,307,311,313

%N Flimsy primes.

%C A number n is flimsy if there exists an integer k such that A000120(kn) < A000120(n).

%H Trevor Clokie et al., <a href="https://arxiv.org/abs/2002.02731">Computational Aspects of Sturdy and Flimsy Numbers</a>, arxiv preprint arXiv:2002.02731 [cs.DS], February 7 2020.

%H Kenneth B. Stolarsky, <a href="https://eudml.org/doc/205727">Integers whose multiples have anomalous digital frequencies</a>, Acta Arithmetica 38 (2) (1980), 117-128.

%Y Cf. A000120. This sequence is the complementary sequence (with respect to the primes) of A143027.

%K nonn,base

%O 1,1

%A _Jeffrey Shallit_, Dec 26 2019

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 May 13 12:32 EDT 2024. Contains 372519 sequences. (Running on oeis4.)