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!)
A285987 a(n)=least number that is cyclops for exactly n distinct bases b > 1. 1

%I #9 Apr 30 2017 11:50:17

%S 1,5,19,51,197,901,2038,5839,13476,18517,36993,60544,60557,60555,

%T 60553,705691,705758,2528254,4762881,5645512,5645535,20250250,

%U 20250249,26733097,66978018,66978001,66978016,66978065,66978193,133956385,187142781,589907497,1018886425

%N a(n)=least number that is cyclops for exactly n distinct bases b > 1.

%C A134808 gives the definition of cyclops numbers for base 10; we can naturally generalize this notion for any base b > 1.

%C This sequence is not strictly increasing; for example: a(12) = 60557 > a(13) = 60555 > a(14) = 60553.

%H Rémy Sigrist, <a href="/A285987/b285987.txt">Table of n, a(n) for n = 0..35</a>

%H Rémy Sigrist, <a href="/A285987/a285987.pdf">Illustration of the first terms</a>

%H Rémy Sigrist, <a href="/A285987/a285987.txt">C program for A285987</a>

%Y Cf. A134808.

%K nonn,base

%O 0,2

%A _Rémy Sigrist_, Apr 30 2017

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 16:34 EDT 2024. Contains 371961 sequences. (Running on oeis4.)