Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A059903
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A059903 Periodic part of continued fraction for sqrt(n), encoded by raising successive primes to the terms. If sqrt(n)=c0+[c1,c2,c3...] then a(n)=2^c1*3^c2*5^c3*... +0
2
1, 4, 18, 1, 16, 324, 72030, 162, 1, 64, 5832, 2916, 372027810, 10588410, 1458, 1, 256, 104976, 1036385881030500, 26244, 9421689827550, 4946387159463750, 1556496270, 13122, 1, 1024, 1889568, 2542277241000, 76256028326940, 236196 (list; graph; listen)
OFFSET

0,2

COMMENT

Could be made less gigantic by omitting final terms in continued fraction, which are always 2*c0.

FORMULA

a(n)=A059900(A059904(n))

EXAMPLE

sqrt(14)=3+[1,2,1,6] so a(14)=2^1*3^2*5^1*7^6=10588410.

CROSSREFS

A059904, A059900, A003285.

Sequence in context: A041701 A132554 A077275 this_sequence A077109 A070923 A064220

Adjacent sequences: A059900 A059901 A059902 this_sequence A059904 A059905 A059906

KEYWORD

easy,nonn

AUTHOR

Marc LeBrun (mlb(AT)well.com), Feb 07 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research