login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074075 Values of m corresponding to the minimization problem of A074074. 2
1, 1, 2, 4, 2, 4, 3, 8, 8, 3, 7, 11, 8, 14, 6, 15, 15, 11, 19, 8, 13, 5, 14, 5, 25, 26, 20, 27, 26, 22, 19, 31, 26, 33, 35, 22, 29, 23, 7, 31, 25, 32, 37, 17, 43, 28, 47, 29, 49, 23, 31, 45, 32, 21, 49, 41, 47, 35, 43, 50, 37, 53, 38, 59, 62, 64, 26, 62, 58, 67, 43, 70, 44, 73, 74, 73, 20 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n) = sqrt( (2n+1)^2-A074074(n))/2 .

CROSSREFS

Cf. A074074.

Sequence in context: A194577 A163894 A032059 * A184186 A004020 A143235

Adjacent sequences:  A074072 A074073 A074074 * A074076 A074077 A074078

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Aug 28 2002

EXTENSIONS

Sequence extended beyond a(7) by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 21 2009

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 16 13:12 EST 2012. Contains 205909 sequences.