
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Continued fraction for 1+sqrt(2) .  Philippe Deléham, Nov 14 2006
a(n) = A213999(n,1).  Reinhard Zumkeller, Jul 03 2012
The least witness function W(k) is defined for odd composite numbers k. The sequence W(k) does not have its own entry in the OEIS because W(k) = 2 for all k with 9 <= k < 2047; then W(2047)=3. Cf. A089105.  N. J. A. Sloane, Sep 17 2014


REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

Table of n, a(n) for n=1..102.
Daniele A. Gewurz and Francesca Merola, Sequences realized as Parker vectors ..., J. Integer Seqs., Vol. 6, 2003.
R. H. Hardin, Binary arrays with both rows and cols sorted, symmetries
Tanya Khovanova, Recursive Sequences
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
Index to divisibility sequences
Index entries for recurrences a(n) = k*a(n  1) +/ a(n  2)
Index entries for sequences related to linear recurrences with constant coefficients, signature (1).


FORMULA

G.f.: 2/(1x), and e.g.f.: 2*e^x [From Mohammad K. Azarian, Dec 22 2008]


MATHEMATICA

Table[2, {105}]


PROG

(PARI) 2 \\ Charles R Greathouse IV, Apr 07 2012
(Haskell)
a007395 = const 2
a007395_list = repeat 2  Reinhard Zumkeller, May 07 2012
(Maxima) makelist(2, n, 0, 30); /* Martin Ettl, Nov 09 2012 */


CROSSREFS

Cf. A000004, A000012, A010701, A089105.
Sequence in context: A084100 A130130 A046698 * A036453 A040000 A239374
Adjacent sequences: A007392 A007393 A007394 * A007396 A007397 A007398


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane.


STATUS

approved

