login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329492 a(n) = smallest d such that the sum of digits of 2^d - n is equal to d, or -1 if no such d exists. 3
0, 2, 4, 6, 3, 10, 103, 9, 5, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The first open case is 11. Is a(11) = -1? See A329493.

If a(i) = m > 0 then A328882 takes the value -i for the first time at term 2^m-i. For example, the first appearance of -7 in A328882 is at term 2^103 - 7.

LINKS

Table of n, a(n) for n=1..10.

CROSSREFS

Cf. A328882, A329002, A329493.

Sequence in context: A057063 A108236 A002849 * A163234 A072984 A317310

Adjacent sequences:  A329489 A329490 A329491 * A329493 A329494 A329495

KEYWORD

nonn,base,more

AUTHOR

N. J. A. Sloane, Nov 16 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 00:36 EDT 2020. Contains 335762 sequences. (Running on oeis4.)