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!)
A058361 a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times. 2

%I #6 May 07 2022 09:26:52

%S 3,1,4,15,22,121,735,31,46,22143,4468,67,31455,391,2308,447,94,33151,

%T 16383,139,202,7551,5224,787,1595391,3685,580,30591,418,42495,1791,

%U 607,1342,3217407,1095166,283,398847,32767,365311,88575,1174,6925,12304383

%N a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times.

%H Amiram Eldar, <a href="/A058361/b058361.txt">Table of n, a(n) for n = 1..84</a>

%t k = {1}; Do[ k = Union[ Join[ k, 2k + 1, 3k + 1 ] ]; l = Length[ k ]; i = 1; While[ i < l && k[ [ i ] ] < 10^9, i++ ]; k = Take[ k, {1, i} ], {n, 1, 30} ]; f[ n_Integer ] := (i = 1; While[ k[ [ i + 1 ] ] - k[ [ i ] ] != n, i++ ]; k[ [ i ] ]); Table[ f[ n ], {n, 1, 84} ]

%Y Cf. A002977, A007448.

%K nonn

%O 1,1

%A _Robert G. Wilson v_, Dec 16 2000

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 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)