The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A335883 The least k for which A335884(k) = n. 1

%I

%S 1,3,5,11,23,47,109,229,457,1033,2161,4703,10079,20663,43223,94033,

%T 208849,420457,872687,1849921,3699841,8748001,17496001,36998411

%N The least k for which A335884(k) = n.

%C Because A335884 is fully additive and a(1) = 3, we have a(n) <= 3^n and in particular, a(n+1) <= 3*a(n), n > 0 and more generally a(n + m) <= a(n) * a(m) where m, n >= 0. (See also comments in A334099.)

%C a(16) = 208849 = 457^2 = a(8)*a(8) is the first composite term.

%F For all n >= 0, A335884(a(n)) = n.

%Y Cf. A335884.

%K nonn,more

%O 0,2

%A _Antti Karttunen_, Jun 29 2020

%E a(21)-a(23) from _Jinyuan Wang_, Jul 08 2020

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.

Last modified October 16 10:19 EDT 2021. Contains 348041 sequences. (Running on oeis4.)