Search: id:A007283
Results 1-1 of 1 results found.

%I A007283 M2561
%S A007283 3,6,12,24,48,96,192,384,768,1536,3072,6144,12288,24576,49152,98304,196608,
%T A007283 393216,786432,1572864,3145728,6291456,12582912,25165824,50331648,100663296,
%U A007283 201326592,402653184,805306368,1610612736,3221225472,6442450944,12884901888
%N A007283 3*2^n.
%C A007283 Same as Pisot sequences E(3,6), L(3,6), P(3,6), T(3,6). See A008776 for 
               definitions of Pisot sequences.
%C A007283 Numbers n such that P[phi[n]]=phi[P[n]], where P[x] is the largest prime-factor 
               of x; A006530[A000010(n)]=A000010[A006530(n)]=2. - Labos E. (labos(AT)ana.sote.hu), 
               May 07 2002
%C A007283 Also least number m such that 2^n is the smallest proper divisor of m 
               which is also a suffix of m in binary representation, see A080940. 
               - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 25 2003
%C A007283 Length of the period of the sequence Fibonacci(k) (mod 2^(n+1)). - Benoit 
               Cloitre (benoit7848c(AT)orange.fr), Mar 12 2003
%C A007283 An autocopy sequence: its first differences are the sequence itself. 
               - Alexandre Wajnberg & Eric Angelini (alexandre.wajnberg(AT)ulb.ac.be), 
               Sep 07 2005
%C A007283 Subsequence of A122132. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Aug 21 2006
%C A007283 Apart from the first term, a subsequence of A124509. - Reinhard Zumkeller 
               (reinhard.zumkeller(AT)gmail.com), Nov 04 2006
%C A007283 Total number of Latin n-dimentional hypercubes (Latin polyhedra) of order 
               3. - Kenji Ohkuma (k-ookuma(AT)ipa.go.jp), Jan 10 2007
%C A007283 Number of different ternary hypercubes of dimension n. - Edwin Soedarmadji 
               (edwin(AT)systems.caltech.edu), Dec 10 2005
%C A007283 For n>=1, a(n) is equal to the number of functions f:{1,2,...,n+1}->{1,
               2,3} such that for fixed, different x_1, x_2,...,x_n in {1,2,...,
               n+1} and fixed y_1, y_2,...,y_n in {1,2,3} we have f(x_i)<>y_i, (i=1,
               2,...,n). - Milan R. Janjic (agnus(AT)blic.net), May 10 2007
%C A007283 3 times powers of 2. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 
               2008]
%C A007283 From Jacobsthal numbers and successive differences. A001045=0,1,1,3,5,
               11,21,43,; A078008=1,0,2,2,6,10,22,42,; A084247 signed=-1,2,0,4,4,
               12,20,44,; A154879=3,-2,4,0,8,8,24,40,. For every sequence k(n), 
               a(n)= k(n)+k(n+3).Then A001045(n)+A001045(n+3), A078008(n)+A078008(n+3), 
               .. . [From Paul Curtz (bpcrtz(AT)free.fr), Feb 05 2009]
%C A007283 a(n) written in base 2: 11, 110, 11000, 110000, ..., i.e.: 2 times 1, 
               n times 0 (see A003953(n)). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), 
               Aug 17 2009]
%D A007283 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007283 T. Ito, Method, equipment, program and storage media for producing tables, 
               Publication number JP2004-272104A, Japan Patent Office(written in 
               Japanese, a(2)=12,a(3)=24,a(4)=48,a(5)=96,a(6)=192,a(7)=384(a(7)=284 
               was corrected)).
%D A007283 Kenji Ohkuma, Atsuhiro Yamagishi and Toru Ito, Cryptography Research 
               Group Technical report, IT Security Center, Information-Technology 
               Promotion Agency, JAPAN.
%D A007283 E. Soedarmadji, Latin Hypercubes and MDS Codes, preprint, 2005.
%H A007283 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%H A007283 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A007283 G.f.: 3/(1-2*x)
%F A007283 a(n)=2a(n-1), n>0; a(0)=3.
%F A007283 a(n) = sum(k=0, n, (-1)^(k reduced (mod 3))*C(n, k)) - Benoit Cloitre 
               (benoit7848c(AT)orange.fr), Aug 20 2002
%F A007283 a(n) = A118416(n+1,2) for n>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Apr 27 2006
%F A007283 a(n)=A000079(n)+A000079(n+1). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), 
               May 12 2007
%F A007283 a(n) = A000079(n)*3. [From Omar E. Pol (info(AT)polprimos.com), Dec 16 
               2008]
%F A007283 a(n) = 2^n + 2^(n-1) for n >= 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), 
               Aug 17 2009]
%p A007283 a:=n->sum(binomial(n,2*j)+binomial(n,j),j=0..n): seq(a(n), n=1..34); 
               - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 12 2007
%p A007283 with(finance):seq(futurevalue(3,1,n), n=0..32);# [From Zerinvary Lajos 
               (zerinvarylajos(AT)yahoo.com), Mar 24 2009]
%t A007283 a=3; lst={a}; k=3; Do[a+=k; AppendTo[lst, a]; k+=k, {n, 0, 5!}]; lst 
               [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 15 2008]
%o A007283 (PARI) a(n)=3*2^n
%Y A007283 Essentially same as A003945 and A042950.
%Y A007283 Row sums of (5, 1)-Pascal triangle A093562 and of (1, 5) Pascal triangle 
               A096940.
%Y A007283 Cf. A002860, A098679, A100540, A124508.
%Y A007283 Cf. Latin squares: A000315, A002860, A003090, A040082, A003191; Latin 
               cubes: A098843, A098846, A098679, A099321.
%Y A007283 Cf. A000079.
%Y A007283 Sequence in context: A046944 A122391 A003945 this_sequence A049942 A099844 
               A165929
%Y A007283 Adjacent sequences: A007280 A007281 A007282 this_sequence A007284 A007285 
               A007286
%K A007283 easy,nonn
%O A007283 0,1
%A A007283 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.002 seconds