login
This site is supported by donations 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, 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; internal format)
OFFSET

0,1

EXAMPLE

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

CROSSREFS

Sequence in context: A102974 A154293 A199717 * A163871 A201915 A072540

Adjacent sequences:  A068305 A068306 A068307 * A068309 A068310 A068311

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 24 2002

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jan 23 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:07 EST 2012. Contains 205668 sequences.