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
6, 0, 11, 13, 24, 37, 54, 73, 102, 133, 162, 193, 234, 277, 330, 383, 444, 503, 564, 635, 714, 797, 876, 967, 1056, 1157, 1260, 1367, 1476, 1603, 1734, 1865, 1992, 2133, 2280, 2429, 2586, 2759, 2916, 3089, 3270, 3453, 3634, 3827, 4038, 4235, 4446, 4673, 4884 (list; graph; refs; listen; history; text; internal format)
OFFSET
-1,1
LINKS
EXAMPLE
For n=1; 11 is largest number m of A024936(m)=1. so a(1) = 11.
CROSSREFS
Cf. A024936.
Sequence in context: A073764 A158897 A033458 * A028651 A028635 A028619
KEYWORD
easy,nonn
AUTHOR
Naohiro Nomoto, Feb 24 2002
EXTENSIONS
More terms from David Wasserman, Jan 23 2003
Updated for change in A024936 by Sean A. Irvine, Feb 07 2024
STATUS
approved

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 26 21:53 EDT 2024. Contains 372004 sequences. (Running on oeis4.)