|
Search: id:A010684
|
|
| |
|
| 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Hankel transform is [1,-8,0,0,0,0,0,0,0,0,...] . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 29 2007
Submitted A153643=2,3,3,5,7,13,23,. A153643(n+1)-2*A153643(n)=-a(n). [From Paul Curtz (bpcrtz(AT)free.fr), Dec 30 2008]
Binomial transform give [1,4,8,16,32,64,...] (A151821(n+1)). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 17 2009]
|
|
FORMULA
|
a(n)=2-(-1)^n. G.f. (1+3x)/((1-x)(1+x)). E.g.f. 2exp(x)-exp(-x) - Paul Barry (pbarry(AT)wit.ie), Apr 29 2003
a(n)=3*(n mod 2)+(n+1) mod 2 - Paolo P. Lava (ppl(AT)spl.at), Oct 20 2006
a(n)=3^(n mod 2) [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 27 2009]
|
|
MAPLE
|
[seq (modp((2*n+1), 4), n=0..80)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 30 2006
|
|
PROGRAM
|
(Other) sage: [power_mod(3, n, 8)for n in xrange(0, 81)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 24 2009]
|
|
CROSSREFS
|
Cf. A112030, A112033.
Sequence in context: A063062 A066056 A153284 this_sequence A112030 A125768 A111742
Adjacent sequences: A010681 A010682 A010683 this_sequence A010685 A010686 A010687
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
