cite e OEIS

claudio” post=74741volevo citare la successione di Lucas come è succesione A000032 del sito OEIS
perche non funziona ho questo codice
o meglio funziona basta commentare la 4 citazione
`
\documentclass[10pt,a4paper,oneside]{book}
\usepackage[T1]{fontenc} % imposta la codifica dei font
\usepackage[utf8]{inputenc} % lettere accentate da tastiera
\usepackage[italian]{babel}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage[upright]{fourier}
\usepackage{imakeidx}
\usepackage{fancyhdr}
\pagestyle{fancy}
\usepackage[italian]{varioref}
\newcommand{\nobs}{\nobreakspace}
\usepackage[babel]{csquotes}
\usepackage[backend=bibtexu]{biblatex}
\bibliography{biblio}
\makeindex
\begin{document}

1 citazione\nobs\cite{just:articolo}

2 citazione\nobs\cite{gardner:articolo}

3 citazione\nobs\cite{Isler:doc}

4 citazione\nobs\cite{oeisA000032}
\addcontentsline{toc}{chapter}{\bibname}
\printbibliography
\end{document}

`

il file bilio è questo

`
@Article{just:articolo,
author = {Erwin Just},
title = {A note on the nth term of the Fibonacci sequence},
journal = {Mathematical Magazine},
year = {1971},
volume = {44},
pages = {199},
}

@Article{gardner:articolo,
author = {Martin Gardner},
title = {Successioni affascinanati: i numeri di Fibonacci e i numeri catalani},
journal = {Le scienze quaderni},
year = {1988},
number = {45},
pages = {13},
month = {dicembre},
}
@Other{Isler:doc,
author = {Romano Isler},
title = {Conferenza sui numeri di Fibonacci in occasione dell'Assemblea annuale dei soci},
year = {2005},
url= {http://mathesis-ud.uniud.it/Articoli/Numeri%20di%20Fibonacci.pdf},
date={24 gennaio 2005}
}
@MISC{oeisA000032,
AUTHOR={_N. J. A. Sloane_. 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 June 27 15:59 EDT 2012. Contains 212562 sequences.},
TITLE={The {O}n-{L}ine {E}ncyclopedia of {I}nteger {S}equences},
HOWPUBLISHED={\href{http://oeis.org/A000032}{A000032}},
MONTH={},
YEAR={},
NOTE={Lucas numbers (beginning at 2): L(n) = L(n-1) + L(n-2). (Cf. A000204.)}
}
`
oeisA000032 è stata ottenuta con link

Saluti
claudio

modificando biblio funziona
`
% This file was created with JabRef 2.8.
% Encoding: UTF8

@ARTICLE{Gardner1988,
author = {Martin Gardner},
title = {Successioni affascinanti: i numeri di Fibonacci e i numeri catalani},
journal = {Le scienze quaderni},
year = {1988},
volume = {45},
pages = {13},
number = {45},
month = {dicembre}
}

@OTHER{Isler:doc,
author = {Romano Isler},
date = {24 gennaio 2005},
title = {Conferenza sui numeri di Fibonacci in occasione dell'Assemblea annuale
dei soci},
url = {http://mathesis-ud.uniud.it/Articoli/Numeri%20di%20Fibonacci.pdf},
year = {2005}
}

@ARTICLE{just:articolo,
author = {Erwin Just},
title = {A note on the nth term of the Fibonacci sequence},
journal = {Mathematical Magazine},
year = {1971},
volume = {44},
pages = {199}
}

@MISC{oeisA000032,
author = {N. J. A. Sloane},
title = {The {O}n-{L}ine {E}ncyclopedia of {I}nteger {S}equences},
howpublished = {http://oeis.org/A000032},
note = {Lucas numbers (beginning at 2): L(n) = L(n-1) + L(n-2). (Cf. A000204.)},
comment = {Maintained by The OEIS Foundation Inc. Content is available under
The OEIS End-User License Agreement . Last modified June 27 15:59
EDT 2012. Contains 212562 sequences.}
}

`
effettivamene c’erano troppe porcate
saluti claudio

egreg9″ post=74747I campi autore e titolo sono certamente sbagliati. Sloane non è certo l’autore dell’Enciclopedia On Line, né quello che citi è l’Enciclopedia On Line, ma solo una sua pagina.

Direi che invece di author ci vada [tt]organization={The OEIS Foundation}[/tt]. Come titolo metterei “Lucas numbers (A000032)”.

Ciao
Enrico

Non è farina del mio sacco la bibliografa vine dal sito OEIS2BibTeX e mi sono basato su ciò
grazie
claudio

edit
grufolando nel OEIS sito ho trovato qualche esempio per discutere
`
A040414 Continued fraction for sqrt(435). 1
20, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1, 40, 1, 5, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET 0,1
LINKS Table of n, a(n) for n=0..83. Index entries for continued fractions for constants
FORMULA a(n)=(1/24)*{-187*(n mod 4)+71*[(n+1) mod 4]+23*[(n+2) mod 4]+281*[(n+3) mod 4]}-20*[C(2*n,n) mod 2], with n>=0
[From Paolo P. Lava, Apr 30 2009]
MAPLE with(numtheory): Digits := 300: convert(evalf(sqrt(435)), confrac);
MATHEMATICA Contribution from Enrique Pérez Herrero, Aug 26 2010: (Start)
A040414[0]:=20;A040414[n_]:=Part[{1, 5, 1, 40}, 1+Mod[n+3, 4]]; (End)
CROSSREFS Sequence in context: A040410 A040413 A040412 * A040415 A040416 A040417
Adjacent sequences: A040411 A040412 A040413 * A040415 A040416 A040417
KEYWORD nonn,cofr,easy
AUTHOR N. J. A. Sloane.
STATUS approved

`
e questo

`
A050414 Numbers n such that 2^n – 3 is prime. 23
3, 4, 5, 6, 9, 10, 12, 14, 20, 22, 24, 29, 94, 116, 122, 150, 174, 213, 221, 233, 266, 336, 452, 545, 689, 694, 850, 1736, 2321, 3237, 3954, 5630, 6756, 8770, 10572, 14114, 14400, 16460, 16680, 20757, 26350, 30041, 34452, 36552, 42689, 44629, 50474, 66422, 69337, 116926, 119324, 123297, 189110, 241004, 247165, 284133, 354946, 394034, 702194, 750740 (list; graph; refs; listen; history; text; internal format)
OFFSET 1,1
COMMENTS I found a new term in the sequence: 20757. 2^20757-3 is a probable prime with 20 iterations of Miller-Rabin test. Also I verified that there are no more primes up to and including 2^25000-3. – Dmitry Kamenetsky, Jul 12 2008 With 60 known primes for n < 750741, these primes appear to be more common than Mersenne primes. Of course at this time, the larger terms are only probable primes. - Paul Bourdelais, Feb 04 2012 LINKS Table of n, a(n) for n=1..60. PRP Top Records of this form [From M. Frind & P. Underwood, Gary Barnes, Oct 20 2008] MATHEMATICA Do[ If[ PrimeQ[ 2^n -3 ], Print[n]], { n, 1, 15000 }] CROSSREFS Cf. A045768, A050415, A057732 (numbers n such that 2^n + 3 is prime). Sequence in context: A047250 A081944 A129948 * A136681 A206330 A104373 Adjacent sequences: A050411 A050412 A050413 * A050415 A050416 A050417 KEYWORD nonn AUTHOR Jud McCranie, Dec 22 1999 EXTENSIONS More terms from Robert G. Wilson v, Sep 15 2000 and from Andrey V. Kulsha, Feb 11 2001 a(40) from Dmitry Kamenetsky, Jul 12 2008 A new PRP term 26350 from Serge Batalov, Oct 20 2008 Corrected and extended by including two smaller (apparently known) PRP and 16 larger terms from PRP Top Records of this form, all discovered by M. Frind & P. Underwood, Gary Barnes, Oct 20 2008 a(59) and a(60) (corresponding to probable primes since they are PRP 3,5,7) discovered by Paul Bourdelais, Mar 26 2012 STATUS approved `