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!)
A065624 Smallest m such that A065623(m) = n. 2
2, 0, 10, 26, 4, 7, 29, 51, 73, 84, 615, 95, 1881, 18698, 117, 2602, 5552, 128, 7938, 19653, 19386, 10156, 1636, 139, 6529, 13629, 20374, 16890, 11920, 6950, 2690, 150, 1925, 5475, 9380, 12575, 15770, 18965, 21805, 24645, 24334, 21849, 19719, 17234 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
EXAMPLE
The first time A065624 = 3 is 26 because A065624(26) = floor(abs(cos(26)/cos(2*26))) = 3.
PROG
(PARI) { for (n=0, 500, m=0; while (floor(abs(cos(m)/cos(2*m))) != n, m++); write("b065624.txt", n, " ", m) ) } \\ Harry J. Smith, Oct 25 2009
CROSSREFS
Cf. A065623.
Sequence in context: A303387 A226958 A346053 * A086890 A167387 A368956
KEYWORD
nonn
AUTHOR
Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Nov 07 2001
EXTENSIONS
a(1) corrected by Harry J. Smith, Oct 25 2009
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 August 15 07:32 EDT 2024. Contains 375173 sequences. (Running on oeis4.)