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!)
A026281 a(n) = least k such that s(k) = n, where s = A026280. 0

%I #4 Mar 30 2012 18:56:05

%S 1,2,3,4,6,8,10,12,13,15,16,18,19,21,22,24,26,27,29,31,32,34,36,37,39,

%T 41,42,44,45,47,49,50,52,53,55,57,58,60,61,63,65,66,68,69,71,73,74,76,

%U 78,79,81,82,84,86,87,89,91,92,94,95,97,99

%N a(n) = least k such that s(k) = n, where s = A026280.

%K nonn

%O 1,2

%A _Clark Kimberling_

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 August 12 16:47 EDT 2024. Contains 375113 sequences. (Running on oeis4.)