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!)
A068308 a(n) = largest number m such that A024936(m) is n. 0

%I #10 Feb 08 2024 01:44:56

%S 6,0,11,13,24,37,54,73,102,133,162,193,234,277,330,383,444,503,564,

%T 635,714,797,876,967,1056,1157,1260,1367,1476,1603,1734,1865,1992,

%U 2133,2280,2429,2586,2759,2916,3089,3270,3453,3634,3827,4038,4235,4446,4673,4884

%N a(n) = largest number m such that A024936(m) is n.

%e For n=1; 11 is largest number m of A024936(m)=1. so a(1) = 11.

%Y Cf. A024936.

%K easy,nonn

%O -1,1

%A _Naohiro Nomoto_, Feb 24 2002

%E More terms from _David Wasserman_, Jan 23 2003

%E Updated for change in A024936 by _Sean A. Irvine_, Feb 07 2024

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 July 23 19:18 EDT 2024. Contains 374553 sequences. (Running on oeis4.)