|
11, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4, 22, 4, 2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Python)
from sympy import sqrt
from sympy.ntheory.continued_fraction import continued_fraction_iterator
def aupton(nn):
gen = continued_fraction_iterator(sqrt(126))
return [next(gen) for i in range(nn+1)]
(Python) # second version based on linear recurrence
def a(n): return 11 if n == 0 else [4, 2, 4, 22][(n-1)%4]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,cofr
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|